#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define MAX 100100
#define pi pair<int,int>
#define mp make_pair
#define fr first
#define sd second
inline int read()
{
	int x=0;bool t=false;char ch=getchar();
	while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
	if(ch=='-')t=true,ch=getchar();
	while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
	return t?-x:x;
}
int n,f[MAX];
int getf(int x){return x==f[x]?x:f[x]=getf(f[x]);}
queue<pi> Q;
map<pi,int> M;
set<int> E[MAX];
pi get(int x,int y){if(x>y)swap(x,y);return mp(x,y);}
void Link(int x,int y)
{
	E[x].insert(y);E[y].insert(x);
	pi u=get(x,y);
	if(++M[u]==2)Q.push(u);
}
int main()
{
	n=read();
	for(int i=1;i<=n;++i)f[i]=i;
	for(int i=1;i<=n+n-2;++i)Link(read(),read());
	for(int i=1,x,y;i<n;++i)
	{
		do
		{
			if(Q.empty()){puts("NO");return 0;}
			x=Q.front().fr,y=Q.front().sd;Q.pop();
			x=getf(x);y=getf(y);
		}while(x==y);
		if(E[x].size()>E[y].size())swap(x,y);
		f[x]=y;M.erase(get(x,y));E[y].erase(x);
		for(auto v:E[x])
		{
			int fv=getf(v);
			if(fv==y)continue;
			M.erase(get(x,fv));
			E[fv].erase(x);//E[x].erase(fv);
			Link(fv,y);
		}
	}
	puts("YES");
	return 0;
}
