#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int rd(){
	int f=1,j=0;
	char w=getchar();
	while(!isdigit(w)){
		if(w=='-')f=-1;
		w=getchar();
	}
	while(isdigit(w)){
		j=j*10+w-'0';
		w=getchar();
	}
	return f*j;
}
const int N=2000010;
const int moda=1000000087,modb=100000841;
int n;
struct Work{
	int head[N],fro[N*2],to[N*2],tail;
	inline void adlin(int x,int y){
		to[++tail]=y,fro[tail]=head[x],head[x]=tail;
		return ;
	}
	int huan[N],cnt;
	int inque[N],rt;
	bool wk[N];
	void dfs1(int u,int fa){
		wk[u]=true;
		for(int k=head[u];k;k=fro[k]){
			int x=to[k];
			if(x==fa)continue;
			if(wk[x])inque[x]=1,inque[u]=1,rt=x;
			else dfs1(x,u);
		}
		return ;
	}
	void dfs2(int u,int fa){
		wk[u]=true;
		for(int k=head[u];k;k=fro[k]){
			int x=to[k];
			if(x==fa||wk[x])continue;
			else dfs2(x,u),inque[u]+=(inque[x]==2)?0:inque[x];
		}
		return ;
	}
	void dfs3(int u,int fa){
		wk[u]=true;
		huan[++cnt]=u;
		for(int k=head[u];k;k=fro[k]){
			int x=to[k];
			if(!inque[x]||wk[x])continue;
			dfs3(x,u);
		}
		return ;
	}
	unsigned long long f[N],pwa[N],pwb[N],pre[N],bac[N];
	int siz[N];
	void cal(int u,int fa){ 
		siz[u]=1;
		for(int k=head[u];k;k=fro[k]){
			int x=to[k];
			if(inque[x]||x==fa)continue;
			cal(x,u);
			siz[u]+=siz[x];
			f[u]+=f[x]*pwa[siz[x]];
		}
		f[u]+=pwa[siz[u]];
		return ;
	}
	void work(){
		pwa[0]=pwb[0]=1;
		for(int i=1;i<=n;i++)pwa[i]=pwa[i-1]*moda,pwb[i]=pwb[i-1]*modb;
		for(int i=1;i<=n;i++){
			int x=rd(),y=rd();
			adlin(x,y),adlin(y,x);
		}
		dfs1(1,0);
		for(int i=1;i<=n;i++)wk[i]=false;
		dfs2(1,0);
//		for(int i=1;i<=n;i++)cout<<inque[i]<<" ";
//		cout<<"\n";
		for(int i=1;i<=n;i++)wk[i]=false;
		dfs3(rt,0);
		for(int i=1;i<=n;i++)inque[i]=false;
		for(int i=1;i<=cnt;i++)inque[huan[i]]=true;
		for(int i=1;i<=cnt;i++)cal(huan[i],0);
//		for(int i=1;i<=cnt;i++)cout<<huan[i]<<" ";
//		cout<<"\n";
//		for(int i=1;i<=cnt;i++)cout<<huan[i]<<":"<<f[huan[i]]<<"\n";
//		cout<<"\n"; 
		for(int i=1;i<=cnt;i++)pre[i]=pre[i-1]*modb+f[huan[i]];
		for(int i=cnt;i>=1;i--)bac[i]=bac[i+1]+f[huan[i]]*pwb[cnt-i];
//		for(int i=1;i<=cnt;i++)cout<<pre[i]<<" ";
//		cout<<"\n";
//		for(int i=1;i<=cnt;i++)cout<<bac[i]<<" ";
//		cout<<"\n";
		return ;
	}
}A,B;
unordered_map<unsigned long long,bool>p;
signed main(){
	n=rd();
	A.work(),B.work();
	bool ans=false;
	if(A.cnt!=B.cnt){
		printf("No\n");
		return 0;
	}
	for(int i=0;i<=A.cnt;i++){
		unsigned long long ansn=A.pre[i]+A.bac[i+1]*A.pwb[i];
//		cout<<i<<":"<<ansn<<"\n"; 
		p[ansn]=true;
	}
	for(int i=0;i<=B.cnt;i++){
		unsigned long long ansn=B.pre[i]+B.bac[i+1]*B.pwb[i];
		if(p[ansn])ans=true;
//		cout<<i<<":"<<ansn<<"\n"; 
	}
	printf((ans)?"Yes\n":"No\n");
	return 0;
}
/*
6
1 2
1 3
2 5
2 6
3 5
4 6
1 5
1 6
2 4
2 5
2 6
3 4
*/