#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> PII;
typedef long long LL;
const int INF = 0x3f3f3f3f3f3f3f3f;

bool multi = 1;

int query(int u, int v) {
    cout << "? " << u << ' ' << v << ' ' << endl;
    int x;
    cin >> x;
    return x;
}

void answer(int x) {
    cout << "! " << x << endl;
}

void solve() {
    int n;
    cin >> n;
    vector<vector<int>> adj(n + 1);
    for(int i = 1; i <= n; i++) {
        int x, y;
        cin >> x >> y;
        for(auto t : {x, y}) {
            if(t == 0) continue;
            adj[i].push_back(t);
            adj[t].push_back(i);
        }
    }
    vector<bool> st(n + 1);
    int bg = 1;
    vector<int> tmp;
    auto dfs1 = [&](auto self, int u, int father) -> void {
        tmp.push_back(u);
        for(auto v: adj[u]) {
            if(v == father || st[v]) continue;
            self(self, v, u);
        }
    };
    vector<int> sz(n + 1), mx(n + 1);
    int rt, tot;
    auto dfs2 = [&](auto self, int u, int father) -> void {
        sz[u] = 1, mx[u] = 0;
        for(auto v: adj[u]) {
            if(v == father || st[v]) continue;
            self(self, v, u);
            sz[u] += sz[v];
            mx[u] = max(mx[u], sz[v]);
        }
        mx[u] = max(mx[u], tot - sz[u]);
        if(mx[rt] > mx[u]) rt = u;
    };
    while(1) {
        tmp.clear();
        dfs1(dfs1, bg, -1);
        tot = tmp.size();
        mx[rt = 0] = INF;
        dfs2(dfs2, bg, -1);
        vector<int> son;
        for(auto v: adj[rt]) {
            if(st[v]) continue;
            son.push_back(v);
        }
        if(son.size() == 0) {
            answer(rt);
            return;
        }
        if(son.size() == 1) {
            int x = query(rt, son[0]);
            if(x == 0) {
                answer(rt);
                return;
            }else if(x == 2) {
                answer(son[0]);
                return;
            }else{
                answer(1);
                return;
            }
        }else if(son.size() == 2) {
            int x = query(son[0], son[1]);
            if(x == 0) {
                bg = son[0];
                st[rt] = 1;
            }else if(x == 1) {
                answer(rt);
                return;
            }else{
                bg = son[1];
                st[rt] = 1;
            }
        }else{
            sort(son.begin(), son.end(), [&](int a, int b) {
                return sz[a] > sz[b];
            });
            int x = query(son[0], son[1]);
            if(x == 0) {
                bg = son[0];
                st[rt] = 1;
            }else if(x == 1) {
                bg = rt;
                st[son[0]] = st[son[1]] = 1;
            }else{
                bg = son[1];
                st[rt] = 1;
            }
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int T = 1;
    if(multi) cin >> T;
    while(T--) {
        solve();
    }

    return 0;
}