#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
set<int>s[N];
map<pair<int,int>,int> ma;
pair<int,int> q[N];
int n,h,t,fa[N];
int get(int x){
	if(fa[x]==x) return x;
	return fa[x]=get(fa[x]);
}
int main(){
	//freopen("B.in","r",stdin);
	//freopen("B.out","w",stdout);
    scanf("%d",&n);
    for (int i=1;i<=n*2-2;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        s[u].insert(v); s[v].insert(u);
        ma[make_pair(u,v)]++; ma[make_pair(v,u)]++;
        if (ma[make_pair(u,v)]==2) q[++t]=make_pair(u,v);
    }
    for (int i=1;i<=n;i++) fa[i]=i;
    set<int>::iterator it;
    while (h<t){
        int u=q[++h].first,v=q[h].second;
        u=get(u); v=get(v);
        s[u].erase(v); s[v].erase(u);
        if (s[u].size()<s[v].size()) swap(u,v);
        for (it=s[v].begin();it!=s[v].end();++it){
            int to=(*it);
            ma[make_pair(to,v)]=ma[make_pair(v,to)]=0;
            s[to].erase(v); s[to].insert(u);
            ma[make_pair(to,u)]++; ma[make_pair(u,to)]++; 
            if (ma[make_pair(to,u)]==2) q[++t]=make_pair(to,u);
            s[u].insert(to);
        }
        fa[v]=u;
        s[v].clear();
    }
    int s=0;
    for (int i=1;i<=n;i++) s+=fa[i]==i;
    if (s==1) printf("YES\n"); else printf("NO\n");
    return 0;
}