#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

typedef pair<int, int> pii;

int N, f[100005], sz[100005];
queue <pii> q;
multiset <int> edg[100005];

int F(int x)
{
    if(f[x] == x)   return x;
    return f[x] = F(f[x]);
}

int main()
{
    #ifdef FILE_IO
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    #endif

    scanf("%d", &N);
    for(int i = 1; i <= 2 * N - 2; i++)
    {
        int x, y;
        scanf("%d%d", &x, &y);

        edg[x].insert(y);
        edg[y].insert(x);

        if(edg[x].count(y) == 2)    q.push({x, y});
    }

    for(int i = 1; i <= N; i++)
        f[i] = i, sz[i] = 1;

    while(!q.empty())
    {
        int x = q.front().first;
        int y = q.front().second;
        q.pop();

        int fx = F(x), fy = F(y);
        if(fx == fy)    continue;
        if(fx != x || fy != y)  continue;

        if(sz[x] > sz[y]) swap(x, y);

        f[x] = y;
        sz[y] += sz[x];

        edg[y].erase(x);
        edg[x].erase(y);

        for(auto nxt: edg[x])
        {
            edg[nxt].erase(x);

            edg[y].insert(nxt);
            edg[nxt].insert(y);

            if(edg[y].count(nxt) == 2)
                q.push({y, nxt});
        }
    }

    if(sz[F(1)] == N)
        printf("YES\n");
    else
        printf("NO\n");

    return 0;
}
