#define _GLIBCXX_IOSTREAM
#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo2(i,n) for(int i=2,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int &x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char &x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char *x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf &x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf &x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint &x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull &x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char *x){while(*x)P(*x++);RT}
I Fw&OP()(const char *x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=100007;

std::list<int>p[N];
int n,fa[N],dep[N],sz[N],nxt[N],id[N],top[N],idm;

void dfs(int x)
{
	sz[x]=1;
	int t=0;
	foe(i,p[x])if(*i!=fa[x])
	{
		fa[*i]=x;
		dep[*i]=dep[x]+1;
		dfs(*i);
		sz[x]+=sz[*i];
		if(sz[*i]>=t)t=sz[*i],nxt[x]=*i;
	}
}

void dfs2(int x,int t)
{
	//out,"dfs2:",x,' ',t,'\n';
	id[x]=++idm;
	top[x]=t;
	if(nxt[x])dfs2(nxt[x],t);
	foe(i,p[x])if(*i!=fa[x]&&*i!=nxt[x])
	{
		dfs2(*i,*i);
	}
}

struct node
{
	std::set<int>f;
	int sz,mi;
}f[270000];

inline void pu(int x)
{
	f[x].mi=min(f[x<<1].mi,f[x<<1|1].mi)+f[x].sz;
}

inline void modify(int x,int l,int r,int p)
{
	if(l==r){f[x].mi=19260817;}
	else
	{
		int t=(l+r)>>1;
		if(p<=t)modify(x<<1,l,t,p);
		else modify(x<<1|1,t+1,r,p);
		pu(x);
	}
}

inline void insert(int x,int l,int r,int ql,int qr,int v)
{
	if(l>=ql&&r<=qr){f[x].f.insert(v);f[x].sz++;f[x].mi++;return;}
	int t=(l+r)>>1;
	if(ql<=t)insert(x<<1,l,t,ql,qr,v);
	if(qr>t)insert(x<<1|1,t+1,r,ql,qr,v);
	pu(x);
}

inline void erase(int x,int l,int r,int ql,int qr,int v)
{
	if(l>=ql&&r<=qr){f[x].f.erase(v);f[x].sz--;f[x].mi--;return;}
	int t=(l+r)>>1;
	if(ql<=t)erase(x<<1,l,t,ql,qr,v);
	if(qr>t)erase(x<<1|1,t+1,r,ql,qr,v);
	pu(x);
}

inline pii query(int x,int l,int r)
{
	if(l==r)return mp(l,f[x].f.size()?*f[x].f.begin():0);
	int t=(l+r)>>1;
	pii v;
	if(f[x<<1].mi<f[x<<1|1].mi)v=query(x<<1,l,t);
	else v=query(x<<1|1,t+1,r);
	if(f[x].f.size())v.yy=*f[x].f.begin();
	return v;
}

struct E
{
	int x,y;
}ee[N];

int main()
{
	in,n;
	fo0(i,n-1)
	{
		int a,b;
		in,a,b;
		p[a].pb(b);
		p[b].pb(a);
	}
	fo0(i,n-1)
	{
		int a,b;
		in,a,b;
		ee[i]=(E){a,b};
	}
	dfs(1);
	dfs2(1,1);
	//fo1(i,n)out,top[i],' ',id[i],'\n';
	modify(1,1,n,1);
	fo0(i,n-1)
	{
		int x=ee[i].x,y=ee[i].y;
		while(top[x]!=top[y])
		{
			//out,x,' ',y,' ',top[x],' ',top[y],'\n';
			if(dep[top[x]]<dep[top[y]])
				/*printf("/%d %d\n",top[y],y),*/insert(1,1,n,id[top[y]],id[y],i),y=fa[top[y]];
			else
				/*printf("/%d %d\n",top[x],x),*/insert(1,1,n,id[top[x]],id[x],i),x=fa[top[x]];
		}
		//printf(".%d %d\n",x,y);
		if(dep[x]<dep[y])insert(1,1,n,id[x]+1,id[y],i);
		else if(dep[y]<dep[x])insert(1,1,n,id[y]+1,id[x],i);		
	}
	fo0(i,n-1)
	{
		//out,f[1].mi,'\n';
		if(f[1].mi!=1)
		{
			out,"NO";
			return 0;
		}
		pii a=query(1,1,n);
		modify(1,1,n,a.xx);
		int x=ee[a.yy].x,y=ee[a.yy].y;
		while(top[x]!=top[y])
		{
			if(dep[top[x]]<dep[top[y]])
				erase(1,1,n,id[top[y]],id[y],a.yy),y=fa[top[y]];
			else
				erase(1,1,n,id[top[x]],id[x],a.yy),x=fa[top[x]];
		}
		//printf("?%d %d\n",x,y);
		if(dep[x]<dep[y])erase(1,1,n,id[x]+1,id[y],a.yy);
		else if(dep[y]<dep[x])erase(1,1,n,id[y]+1,id[x],a.yy);
	}
	out,"YES";
}

Measured memory_bytes: 128640