#include<bits/stdc++.h>
#define fi first
#define sc second
const int N=100010;
using namespace std;
int n,fa[N];
multiset<int> s[N];
map<pair<int,int> ,int> mps1,mps2;
queue<pair<int,int> >q;
inline pair<int,int> makepair(int x,int y){
	if(x>y)return pair<int,int>(y,x);
	return pair<int,int>(x,y);
}
inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
inline int read(){
	int f=1,x=0;char ch;
	do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
	do{x=x*10+ch-'0';ch=getchar();}while(ch>='0'&&ch<='9');
	return f*x;
}
int main(){
	n=read();
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1;i<2*n-1;i++){
		int u=read(),v=read();
		s[u].insert(v);s[v].insert(u);
		pair<int,int> p=makepair(u,v);
		if((++mps1[p]>1)&&!mps2.count(p))mps2[p]=1,q.push(p);
	}
	for(int i=1;i<n;i++){
		int x,y;
		while(1){
			if(q.empty())return puts("NO"),0;
			x=find(q.front().fi);y=find(q.front().sc);q.pop();
			if(x!=y)break;
		}
		if(s[x].size()>s[y].size()) swap(x,y); fa[x]=y;
        for(set<int>::iterator it=s[x].begin();it!=s[x].end();it++){
            int v=find(*it);
            if(v==y)continue;
            s[y].insert(v); s[v].insert(y);
            if((++mps1[makepair(y,v)])>1&&!mps2.count(makepair(y,v)))
                q.push(makepair(y,v)),mps2[makepair(y,v)]=1;
            s[v].erase(s[v].find(x));
        }
        s[y].erase(x);s[x].clear();
	}
	puts("YES");
}