#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<queue>
#include<iostream>using namespace std;#define For(i,forN) for(int i=0;i<forN;i++)
#define ForEdge(i,u) for(int i=head[u];i!=-1;i=edge[i].next)
#define sf  scanf
#define pf  printf
#define mp  make_pair#define _clr(x,y)   memset(x,(y),sizeof(x))typedef unsigned int UI ;
const int Maxn=21000,Mod=2081,hx=557,hy=131;
/*判断树的同构，用此hash函数：
*/
int head[Maxn],etot,Cc[Maxn];
int n;
UI  Hash[Maxn];
bool vis[Maxn];struct Edge
{int to,next;
}edge[Maxn*2];void init_edge()
{etot=0;_clr(head,-1);
}void add_edge(int u,int v)
{edge[etot].to=v;edge[etot].next=head[u];head[u]=etot++;
}void dfs(int u)
{vis[u]=true;vector < int > Ve;ForEdge(i,u){int v=edge[i].to;if(!vis[v]){dfs(v);Ve.push_back(Hash[v]);}}sort(Ve.begin(),Ve.end());  Ve.push_back(1);//可以看做字符')',或者1UI b = 378551 , a = 63689;Hash[u]=0;//可以看做字符'('，或者0
    For(i,Ve.size()){Hash[u]=Hash[u]*a+Ve[i];a*=b;}Hash[u]&=0x7FFFFFFF;
}int din[Maxn],stk[Maxn],top;
int ans[2][2];int main()
{while(~sf("%d",&n)){int tid[2]={0};for(int cas=0;cas<2;cas++){init_edge();int u,v;queue < int > q;_clr(din,0);for(int i=1;i<n;i++){sf("%d%d",&u,&v);din[u]++,din[v]++;add_edge(u,v);add_edge(v,u);}int last=n;_clr(vis,false);for(int i=1;i<n+1;i++){if(din[i]==1)   q.push(i),last--,vis[i]=true;}while(last!=0 && !q.empty()){u=q.front();    q.pop();    din[u]--;ForEdge(i,u){int v=edge[i].to;if(!vis[v]){din[v]--;if(din[v]==1)q.push(v),last--,vis[v]=true;}}}for(int i=1;i<=n;i++){if(din[i]==1){_clr(vis,false);    dfs(i);ans[cas][tid[cas]++]=Hash[i];if(tid[cas]>2)  while(1);}}}bool flag=false;for(int i=0;i<tid[0];i++)for(int j=0;j<tid[1];j++)if(ans[0][i] == ans[1][j])flag=true;if(flag)    puts("S");else    puts("N");}return 0;
}