#include <bits/stdc++.h>
#define ll long long
#define mk make_pair
using namespace std;
 
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9;
  
int n, m, no[N];
set<int> G1[N], G2[N];
queue< pair<int, int> > q;
map< pair<int, int>, int> cnt;

int main() {
	scanf("%d", &n);
	for (int i = 1; i < n; i++) {
		int x, y;
		scanf("%d %d", &x, &y);
		if (x > y) swap(x, y);
		G1[x].insert(y);
		G1[y].insert(x);
		cnt[mk(x, y)]++;
	}
	for (int i = 1; i < n; i++) {
		int x, y;
		scanf("%d %d", &x, &y);
		if (x > y) swap(x, y);
		G2[x].insert(y);
		G2[y].insert(x);
		cnt[mk(x, y)]++;
		if (cnt[mk(x, y)] == 2) q.push(mk(x, y));
	}
	while (q.size()) {// cout << "/";
		int x = q.front().first;
		int y = q.front().second;
		q.pop(); // cout << x << "," << y << endl;
		if (no[x] || no[y]) continue;
		m++;
		no[y] = 1;
		G1[x].erase(G1[x].find(y));
		G1[y].erase(G1[y].find(x));
		G2[x].erase(G2[x].find(y));
		G2[y].erase(G2[y].find(x));
		for (auto i: G1[y]) {
			int xx = i, yy = x;
			if (xx > yy) swap(xx, yy);
			G1[x].insert(i);
			G1[i].insert(x);
			cnt[mk(xx, yy)]++;
			if (cnt[mk(xx, yy)] == 2) q.push(mk(xx, yy));
		}
		for (auto i: G2[y]) {
			int xx = i, yy = x;
			if (xx > yy) swap(xx, yy);
			G2[x].insert(i);
			G2[i].insert(x);
			cnt[mk(xx, yy)]++;
			if (cnt[mk(xx, yy)] == 2) q.push(mk(xx, yy));
		}
	} 
	if (m == n - 1) puts("YES");
	else puts("NO");
}