#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
inline int getInt() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;
typedef v(vp) vvp;

queue<P> q;

// Quick find
struct qf {
  vi g;
  vvi d;
  v(set<int>) e;
  qf(){}
  qf(int mx):g(mx),d(mx,vi(1)),e(mx) {
    rep(i,mx) g[i] = i, d[i][0] = i;
  }
  void add(int a, int b) {
    if (e[a].count(b)) {
      e[a].erase(b);
      e[b].erase(a);
      q.emplace(a,b);
    } else {
      e[a].insert(b);
      e[b].insert(a);
    }
  }
  bool unite(int a, int b) {
    a = g[a]; b = g[b];
    if (a == b) return false;
    if (sz(d[a]) < sz(d[b])) swap(a,b);
    d[a].insert(d[a].end(), rng(d[b]));
    for (int i : d[b]) g[i] = a;    
    d[b] = vi();
    for (int v : e[b]) {
      e[v].erase(b);
      if (e[a].count(v)) {
        e[a].erase(v);
        e[v].erase(a);
        q.emplace(a,v);
        continue;  
      }
      e[a].insert(v);
      e[v].insert(a);
    }
    return true;
  }
  bool same(int a, int b) const { return g[a] == g[b];}
  int size(int v) const { return sz(d[g[v]]);}
  int operator[](int v) const { return g[v];}
};
//

int main() {
  int n;
  scanf("%d",&n);
  qf t(n);
  rep(j,2) {
    rep(i,n-1) {
      int a,b;
      scanf("%d%d",&a,&b);
      --a; --b;
      t.add(a,b);
    }
  }
  int cnt = 0;
  while (sz(q)) {
    int a = q.front().fi;
    int b = q.front().se; q.pop();
    if (!t.unite(a,b)) break;
    ++cnt;
  }
  if (cnt == n-1) yn;
  return 0;
}






















Measured memory_bytes: 30636