#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize(3)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC target("sse3","sse2","sse")
//#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
//#pragma GCC target("f16c")
//#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
//#pragma GCC diagnostic error "-fwhole-program"
//#pragma GCC diagnostic error "-fcse-skip-blocks"
//#pragma GCC diagnostic error "-funsafe-loop-optimizations"
//#pragma GCC diagnostic error "-std=c++14"
#include "bits/stdc++.h"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/pb_ds/assoc_container.hpp"

#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define REP(x, l, u) for(ll x = l;x<u;x++)
#define RREP(x, l, u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(begin(a),end(a)),end(a))
#define mst(x, a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rall(a) rbegin(a),rend(a)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define lowbit(x) ((x)&(-(x)))
#define bitcnt(x) (__builtin_popcountll(x))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define sz(x) ((int)x.size())
#define EX0 exit(0);

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace __gnu_pbds; //required
using namespace std;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef vector<ll> VLL;
typedef vector<int> VI;
const ll mod = 1e9 + 7;


string to_string (string s) { return '"' + s + '"'; }

string to_string (const char *s) { return to_string ((string) s); }

string to_string (bool b) { return (b ? "true" : "false"); }

template<typename A, typename B>
string to_string (pair<A, B> p) { return "(" + to_string (p.first) + ", " + to_string (p.second) + ")"; }

template<typename A>
string to_string (A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) { res += ", "; }
        first = false;
        res += to_string (x);
    }
    res += "}";
    return res;
}

void debug_out () { cerr<<endl; }

template<typename Head, typename... Tail>
void debug_out (Head H, Tail... T) {
    cerr<<" "<<to_string (H);
    debug_out (T...);
}

#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) {}
#endif

template<typename T, typename S>
inline bool upmin (T &a, const S &b) { return a > b ? a = b, 1 : 0; }

template<typename T, typename S>
inline bool upmax (T &a, const S &b) { return a < b ? a = b, 1 : 0; }


ull twop (ll x) { return 1ULL<<x; }

ll MOD (ll a, ll m) {
    a %= m;
    if (a < 0)a += m;
    return a;
}

ll inverse (ll a, ll m) {
    a = MOD (a, m);
    if (a <= 1)return a;
    return MOD ((1 - inverse (m, a) * m) / a, m);
}

template<typename T>
T sqr (T x) { return x * x; }

ll gcd (ll a, ll b) {
    a = abs (a), b = abs (b);
    while (b != 0) {
        a %= b;
        swap (a, b);
    }
    return a;
}

ll fast (ll a, ll b, ll mod) {
    a %= mod;
    if (b < 0)a = inverse (a, mod), b = -b;
    ll ans = 1;
    while (b) {
        if (b & 1)ans = ans * a % mod;
        a = a * a % mod;
        b /= 2;
    }
    return ans % mod;
}


int n;
const ll N = 100100;
int u[N], v[N];
bool vis[N];

struct SegTree {
    static const int maxn = 100100;
    
    struct node {
        int l, r;
        int val, lazy;
        VI path;
        
        int get_val () {
            return val + lazy;
        }
    };
    
    node no[maxn * 4];
    
    void push_up (int ind) {
        no[ind].val = min (no[lson].get_val (), no[rson].get_val ());
    }
    
    void push_down (int ind) {
        no[lson].lazy += no[ind].lazy;
        no[rson].lazy += no[ind].lazy;
        no[ind].lazy = 0;
    }
    
    void build (int l, int r, int ind) {
        no[ind].l = l;
        no[ind].r = r;
        no[ind].lazy = no[ind].val = 0;
        if (l == r) {
        
        } else {
            int mid = (l + r) / 2;
            build (l, mid, lson);
            build (mid + 1, r, rson);
            push_up (ind);
        }
    }
    
    void update (int l, int r, int ind, int val, int id) {
        if (l > no[ind].r || r < no[ind].l)return;
        if (l <= no[ind].l && no[ind].r <= r) {
            no[ind].lazy += val;
            if (id)no[ind].path.PB (id);
        } else {
            push_down (ind);
            update (l, r, lson, val, id);
            update (l, r, rson, val, id);
            push_up (ind);
        }
    }
    
    void clean (int ind) {
        if (no[ind].get_val ())return;
        if (no[ind].l == no[ind].r) {
            no[ind].val = 1e9;
        } else {
            push_down (ind);
            clean (lson);
            clean (rson);
            push_up (ind);
            if (no[ind].get_val () == 0)no[ind].val = 1e9;
        }
    }
    
    int gao (int ind) {
        if (no[ind].get_val () != 1)return -1;
        while (sz(no[ind].path) and vis[no[ind].path.back ()]) {
            no[ind].path.pop_back ();
        }
        if (sz(no[ind].path)) {
            int id = no[ind].path.back ();
            return id;
        } else {
            push_down (ind);
            int id = gao (lson);
            if (id != -1)return id;
            else id = gao (rson);
            push_up (ind);
            return id;
        }
    }
    
};
namespace HLD {
    SegTree tree;
    
    //0不能被使用
    struct Edge {
        int to, len;
        
        Edge (int to, int len = 1) : to (to), len (len) {}
    };
    
    const int root = 1;
    const int maxn = 200010;
    vector<Edge> adj[maxn];
    int dfnToID[maxn], dfn[maxn], head[maxn], fa[maxn], size[maxn], heavy[maxn], r[maxn], cnt = 1;
    ll dep[maxn];
    
    void addEdge (int u, int v, int len = 1) {
        adj[u].emplace_back (v, len);
        adj[v].emplace_back (u, len);
    }
    
    void firstDfs (int cur, int _fa) {
        size[cur] = 1;
        fa[cur] = _fa;
        for (auto e:adj[cur]) {
            if (e.to != _fa) {
                dep[e.to] = dep[cur] + e.len;
                firstDfs (e.to, cur);
                size[cur] += size[e.to];
            }
        }
        int heavyChild = 0;
        for (auto e:adj[cur]) {
            if (e.to != _fa) {
                if (size[e.to] > size[heavyChild]) {
                    heavyChild = e.to;
                }
            }
        }
        heavy[cur] = heavyChild;
    }
    
    
    void secondDfs (int cur, int _fa) {
        if (cur != heavy[_fa]) {
            head[cur] = cur;
        } else {
            head[cur] = head[_fa];
        }
        dfn[cur] = cnt++;
        r[cur] = dfn[cur];
        dfnToID[dfn[cur]] = cur;
        if (!heavy[cur])return;
        secondDfs (heavy[cur], cur);
        r[cur] = r[heavy[cur]];
        for (auto e:adj[cur]) {
            if (e.to == _fa || e.to == heavy[cur])continue;
            secondDfs (e.to, cur);
            r[cur] = r[e.to];
        }
    }
    
    void init () {
        cin>>n;
        REP(i, 1, n) {
            int a, b;
            cin>>a>>b;
            addEdge (a, b);
        }
        dep[1] = 0;
        firstDfs (root, 0);
        secondDfs (root, 0);
        tree.build (2, n, 1);
    }
    
    
    int kthFather (int k, int cur) {
        while (k) {
            if (head[cur] == cur) {
                k--;
                cur = fa[head[cur]];
            } else {
                if (dep[cur] - dep[head[cur]] <= k) {
                    k -= dep[cur] - dep[head[cur]];
                    cur = head[cur];
                } else {
                    return dfnToID[dfn[cur] - k];
                }
            }
        }
        return cur;
    }
    
    int LCA (int u, int v) {
        while (head[u] != head[v]) {
            if (dep[head[u]] > dep[head[v]])swap (u, v);
            v = fa[head[v]];
        }
        if (dep[u] < dep[v])return u;
        return v;
    }
    
    int dis (int u, int v) {
        return dep[u] + dep[v] - 2 * dep[LCA (u, v)];
    }
    
    
    bool inSubtree (int root, int node) {
        return dfn[root] <= dfn[node] and dfn[node] <= r[root];
    }
    
    void addPath (int u, int v, int delta, int id) {
        while (head[u] != head[v]) {
            if (dep[head[u]] > dep[head[v]])swap (u, v);
            tree.update (dfn[head[v]], dfn[v], 1, delta, id);
            v = fa[head[v]];
        }
        if (dep[v] > dep[u])swap (u, v);
        tree.update (dfn[v] + 1, dfn[u], 1, delta, id);
    }
    
    
    void solve () {
        REP(i, 1, n) {
            cin>>u[i]>>v[i];
            addPath (u[i], v[i], 1, i);
        }
        
        REP(i, 1, n) {
            int res = tree.gao (1);
            dbg(res);
            if (res == -1) {
                cout<<"NO";
                return;
            } else {
                vis[res] = 1;
                addPath (u[res], v[res], -1, 0);
                tree.clean (1);
            }
        }
        cout<<"YES"<<endl;
    }
}

namespace SOLVE {
    void main () {
        HLD::init ();
        HLD::solve ();
    }
}


signed main () {
#ifdef LOCAL
    fr("/Users/zhangqingchuan/Desktop/cp/cp/input.txt");
    fw("/Users/zhangqingchuan/Desktop/cp/cp/output.txt");
#endif
    ios::sync_with_stdio (false);
    cin.tie (nullptr);
    cout.tie (nullptr);
    
    
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout<<"Case #"<<i<<": ";
        SOLVE::main ();
        
    }








//    clock_t st = clock();
//    while(clock() - st < 3.0 * CLOCKS_PER_SEC){
//
//    }
    
    
    
    
    
    
    return 0;
}


Measured memory_bytes: 48860