// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int N;
vector<int> G0[MAXN], G1[MAXN];
std::set<Pii> E0, E1;
std::queue<Pii> q;

void input()
{
    read(N);
    for (int i = 1; i < N; ++i) {
        int u, v;
        read(u); read(v);
        if (u > v) std::swap(u, v);
        G0[u].push_back(v);
        G0[v].push_back(u);
        E0.insert(MP(u, v));
    }
    for (int i = 1; i < N; ++i) {
        int u, v;
        read(u); read(v);
        if (u > v) std::swap(u, v);
        G1[u].push_back(v);
        G1[v].push_back(u);
        E1.insert(MP(u, v));
    }
}

int fa[MAXN];

int getFather(int u)
{
    return fa[u] == u ? u : fa[u] = getFather(fa[u]);
}

void solve()
{
    for (std::set<Pii>::iterator it = E1.begin(); it != E1.end(); ++it) {
        if (E0.find(*it) != E0.end())
            q.push(*it);
    }

    int tot = 0;
    for (int i = 1; i <= N; ++i) {
        fa[i] = i;
    }
    while (!q.empty()) {
        Pii e = q.front(); q.pop();
        if (getFather(e.x) != e.x || getFather(e.y) != e.y)
            continue;
        assert(E0.find(e) != E0.end());
        assert(E1.find(e) != E1.end());
        ++tot;
        E0.erase(e);
        E1.erase(e);
        if (SZ(G0[e.x]) + SZ(G1[e.x]) > SZ(G0[e.y]) + SZ(G1[e.y]))
            std::swap(e.x, e.y);
        for (int i = 0; i < SZ(G0[e.x]); ++i) {
            int v = getFather(G0[e.x][i]);
            Pii e0(e.x, v), e1(e.y, v);
            if (e0.x > e0.y) std::swap(e0.x, e0.y);
            if (e1.x > e1.y) std::swap(e1.x, e1.y);
            if (E0.find(e0) != E0.end()) {
                E0.erase(e0);
                E0.insert(e1);
                G0[e.y].push_back(v);
                if (E1.find(e1) != E1.end())
                    q.push(e1);
            }
        }
        for (int i = 0; i < SZ(G1[e.x]); ++i) {
            int v = getFather(G1[e.x][i]);
            Pii e0(e.x, v), e1(e.y, v);
            if (e0.x > e0.y) std::swap(e0.x, e0.y);
            if (e1.x > e1.y) std::swap(e1.x, e1.y);
            if (E1.find(e0) != E1.end()) {
                E1.erase(e0);
                E1.insert(e1);
                G1[e.y].push_back(v);
                if (E0.find(e1) != E0.end())
                    q.push(e1);
            }
        }
        fa[e.x] = e.y;
    }

    puts(tot == N - 1 ? "YES" : "NO");
}

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

    input();
    solve();

    return 0;
}

// 无由持一碗，寄与爱茶人。
//     -- 白居易《山泉煎茶有怀》


Measured memory_bytes: 22336