#include <bits/stdc++.h>

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

std::map<std::vector<int>,int> mp;

struct HashTree {
    std::vector<std::vector<int>> adj;
    int n;

    HashTree(int _n) {
        n = _n;
        adj.resize(_n);
    }

    void add(int u, int v) {
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    int dfs(int u, int fa) {
        std::vector<int> f;
        for (int v: adj[u]) {
            if (v != fa) {
                f.push_back(dfs(v, u));
            }
        }
        std::sort(f.begin(), f.end());
        int w = mp[f];
        if (!w) {
            w = mp.size();
        }
        return mp[f] = w;
    }
};

void solve() {
    mp.clear();
    int n;
    std::cin >> n;

    HashTree A(n), B(n);
    for (int i = 1; i < n; i++) {
        int u, v;
        std::cin >> u >> v;
        u--;
        v--;
        A.add(u, v);
    }
    for (int i = 1; i < n; i++) {
        int u, v;
        std::cin >> u >> v;
        u--;
        v--;
        B.add(u, v);
    }
    if (A.dfs(0, -1) == B.dfs(0, -1)) {
        std::cout << "Isomorphism\n";
    } else {
        std::cout << "No\n";
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);

    int T = 1;
    std::cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}