#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
inline int read(){
	int s=0;char ch=getchar();
	while(!isdigit(ch)) ch=getchar();
	while(isdigit(ch)) s=s*10+ch-'0',ch=getchar();
	return s;
}
typedef pair<int,int> pii;
#define fi first
#define se second
int n;
set<int> s[N];
map<pii,int> mp; 
queue<pii> q;
int fa[N];
inline int findf(int x){
	return x==fa[x]?x:fa[x]=findf(fa[x]);
}
int main(){
	n=read();
	for(int i=1;i<=2*(n-1);i++){
		int x=read(),y=read();
		if(x>y) swap(x,y);
		s[x].insert(y),s[y].insert(x);
		pii p=make_pair(x,y);
		mp[p]++;
		if(mp[p]==2) q.push(p);
	}
	for(int i=1;i<=n;i++) fa[i]=i;
	for(int i=1;i<n;i++){
		if(q.empty()) {
			puts("NO");
			return 0;
		}
		int x=0,y=0;
		while(!q.empty()&&x==y) x=findf(q.front().fi),y=findf(q.front().se),q.pop();
		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 z=*it;
			s[z].erase(x);
			if(z==y) continue;
			s[z].insert(y);s[y].insert(z);
			pii p;
			if(z<y) p=make_pair(z,y);
			else p=make_pair(y,z);
			mp[p]++;
			if(mp[p]==2) q.push(p);
		}
	}
	puts("YES");
	return 0;
}