//author: hitch_hiker42;
#include<bits/stdc++.h>
using namespace std;
 
//solution:
#define int int64_t
#define span(a) begin(a), end(a)
constexpr int mxn = 1e5 + 1;
 
struct tree {
  int n, lvl;
  vector<vector<int>> adj, level;
  vector<int> label, parent;
  tree() = default;
  tree(int n): n(n), lvl(0) {
    adj.assign(n + 1, vector<int>());
    level.assign(n + 1, vector<int>());
    label.assign(n + 1, -1);
    parent.assign(n + 1, 0);
  }
  void insert(int u, int v) {
    adj[u].emplace_back(v);
    adj[v].emplace_back(u);
  }
  void dfs(int u, int p, int l) {
    level[l].emplace_back(u);
    parent[u] = p, lvl = max(lvl, l);
    for(auto& v: adj[u]) if(v != p) {
      dfs(v, u, l + 1);
    }
  }
};
 
bool is_equal(vector<pair<vector<int>, int>>& x, vector<pair<vector<int>, int>>& y) {
  if(x.size() != y.size()) return false;
  for(int i = 0, n = x.size(); i < n; ++i) {
    if(x[i].first != y[i].first) return false;
  }
  return true;
}
 
bool isomorphic(int n, tree& t1, int r1, tree& t2, int r2) {
  t1.dfs(r1, 0, 0), t2.dfs(r2, 0, 0);
  if(t1.lvl != t2.lvl) return false;
  vector<int> l1, l2;
  vector<pair<vector<int>, int>> s1, s2;
  vector<int> aux1[n + 1], aux2[n + 1];
  for(int i = t1.lvl; ; --i) {
    if(i == t1.lvl) { //basis: last level;
      for(auto& u: t1.level[i]) {
        t1.label[u] = 1;
        l1.emplace_back(u);
      }
      for(auto& u: t2.level[i]) {
        t2.label[u] = 1;
        l2.emplace_back(u);
      }
      continue;
    }
    //push from the last level to this level:
    for(int& u: l1) {
      aux1[t1.parent[u]].emplace_back(t1.label[u]);
    }
    for(int& u: l2) {
      aux2[t2.parent[u]].emplace_back(t2.label[u]);
    }
    l1.clear(), l2.clear();
    //merge all aux-tuples of this level:
    for(auto& u: t1.level[i]) {
      sort(span(aux1[u]));
      s1.emplace_back(aux1[u], u);
      l1.emplace_back(u);
    }
    for(auto& u: t2.level[i]) {
      sort(span(aux2[u]));
      s2.emplace_back(aux2[u], u);
      l2.emplace_back(u);
    }
    sort(span(s1)), sort(span(s2));
    if(!is_equal(s1, s2)) return false;
    //label the nodes of this level:
    t1.label[s1[0].second] = t2.label[s2[0].second] = 1;
    for(int j = 1, k = s1.size(), idx = 1; j < k; ++j) {
      if(s1[j].first == s1[j — 1].first) {
        t1.label[s1[j].second] = t2.label[s2[j].second] = idx;
      } else {
        t1.label[s1[j].second] = t2.label[s2[j].second] = ++idx;
      }
    }
    s1.clear(), s2.clear();
  }
  return true;
}
 
void hike() {
  int n; cin >> n;
  tree t1(n), t2(n);
  for(int i = 1; i < n; ++i) {
    int u, v; cin >> u >> v;
    t1.insert(u, v);
  }
  for(int i = 1; i < n; ++i) {
    int u, v; cin >> u >> v;
    t2.insert(u, v);
  }
  if(isomorphic(n, t1, 1, t2, 1)) cout << "YES\n";
  else cout << "NO\n";
}
 
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
  int t = 1; cin >> t;
  while(t--) hike();
  return 0;
} //farewell, until we meet again..

//author: hitch_hiker42;
#include<bits/stdc++.h>
using namespace std;
 
//solution:
#define int int64_t
#define span(a) begin(a), end(a)
 
mt19937_64 mersenne{static_cast<mt19937_64::result_type>(time(nullptr))};
constexpr int mxn = 1e5 + 1, x = 988'244'353, mod = 1e9 + 7;

vector<int> adj[2][mxn];
int n, node[2][mxn];
 
int rng(int l, int r) {
  return uniform_int_distribution<int>(l, r)(mersenne);
}
 
void reset() {
  for(int i = 1; i <= n; ++i) adj[0][i].clear(), adj[1][i].clear();
}
 
int nodehash(int u, int p, int l, int t, int key) {
  int hash = l;
  vector<int> childhashes;
  for(auto& v: adj[t][u]) if(v != p) {
    childhashes.push_back(node[t][v]);
  }
  sort(span(childhashes));
  for(int i = 0, m = childhashes.size(), power = 1; i < m; ++i, (power *= x) %= mod) {
    (hash += power * childhashes[i] % mod * key % mod) %= mod;
  }
  return hash;
}
 
void dfs(int u, int p, int l, int t, int key) {
  for(auto& v: adj[t][u]) if(v != p) {
    dfs(v, u, l + 1, t, key);
  }
  node[t][u] = nodehash(u, p, l, t, key);
}
 
void hike() {
  cin >> n;
  for(int i = 1; i < n; ++i) {
    int u, v; cin >> u >> v;
    adj[0][u].emplace_back(v);
    adj[0][v].emplace_back(u);
  }
  for(int i = 1; i < n; ++i) {
    int u, v; cin >> u >> v;
    adj[1][u].emplace_back(v);
    adj[1][v].emplace_back(u);
  }
  for(int i = 0; i < 5; ++i) {
    int key = rng(1, x);
    dfs(1, 0, 0, 0, key);
    dfs(1, 0, 0, 1, key);
    if(node[0][1] != node[1][1]) return void(cout << "NO\n");
  }
  if(node[0][1] == node[1][1]) cout << "YES\n";
  else cout << "NO\n";
}
 
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
  int t = 1; cin >> t;
  while(t--) hike(), reset();
  return 0;
} //farewell, until we meet again..