#include <bits/stdc++.h>
using namespace std;

const int N = 100005;

int n;
multiset <int> conn[N];
map <int,int> e[N];

void erase(int u, int v) {
	multiset<int>::iterator it = conn[u].find(v);
	conn[u].erase(it);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n;
	for (int i = 1; i <= 2 * n - 2; ++i) {
		int u, v; cin >> u >> v;
		e[u][v]++; e[v][u]++;
		conn[u].insert(v); conn[v].insert(u);
	}
	queue < pair<int,int> > q;
	for (int i = 1; i <= n; ++i) {
		for (map<int,int>::iterator it = e[i].begin(); it != e[i].end(); ++it) {
			if (it->first > i && e[i][it->first] >= 2) q.push(make_pair(i, it->first));
		}
 	}

 	while(!q.empty()) {
 		int u = q.front().first, v = q.front().second; q.pop();
 		if (conn[u].empty() || conn[v].empty()) continue;
 		if (e[u][v] > 2) return printf("NO\n"), 0;
 		if (conn[u].size() < conn[v].size()) swap(u, v);
 		erase(u, v); erase(u, v); e[u][v] -= 2;
 		erase(v, u); erase(v, u); e[v][u] -= 2;

 		for (auto w : conn[v]) {
 			erase(w, v); e[w][v]--; e[v][w]--;
 			conn[w].insert(u); e[w][u]++;
 			conn[u].insert(w); e[u][w]++;
 			if (e[u][w] >= 2) q.push(make_pair(u,w));
 		}
 		conn[v].clear();
 	}

 	for (int i = 1; i <= n; ++i) if (!conn[i].empty()) return printf("NO\n"), 0;
 	printf("YES\n");
}