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

typedef long long ll;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 100005;

int n, par[N], ch[N], tot;
bool blk[N];
vector<int> adj[N];

void calc (int C, int P) {
    par[C] = P;
    ch[C] = 1;
    for(auto &T : adj[C]) {
        if(T == P || blk[T]) continue;
        calc(T, C);
        ch[C] += ch[T];
    }
}

int get_nr (int C, int P) {
    pii mxc = {-1, -1};
    vector<int> cs;
    if (P) {
        mxc = {tot - ch[C], P};
    }
    for(auto &T : adj[C]) {
        if(T == P || blk[T]) continue;
        if (ch[T] > mxc.first) {
            if(mxc.first != -1) {
                cs.push_back(mxc.second);
            }
            mxc = {ch[T], T};
        }
        else {
            cs.push_back(T);
        }
    }
    if (mxc.first > tot / 2) {
        return get_nr(mxc.second, C);
    }
    int A = mxc.second, B = cs[0];
    printf("? %d %d\n", A, B);
    fflush(stdout);
    int T;
    scanf("%d",&T);
    if (T == 0) {
        blk[C] = true;
        return A;
    }
    if (T == 2) {
        blk[C] = true;
        return B;
    }
    if (cs.size() <= 1) {
        printf("! %d\n", C);
        fflush(stdout);
        return -1;
    }
    blk[A] = true;
    blk[B] = true;
    return C;
}

void cend(int R) {
    calc(R, 0);
    tot = ch[R];
    if (tot == 1) {
        printf("! %d\n", R);
        fflush(stdout);
        return;
    }
    else if (tot == 2) {
        int X;
        for(auto &T : adj[R]) {
            if(!blk[T]) {
                X = T;
                break;
            }
        }
        printf("? %d %d\n", R, X);
        fflush(stdout);
        int T;
        scanf("%d",&T);
        if(T == 0) printf("! %d\n", R);
        else printf("! %d\n", X);
        fflush(stdout);
        return;
    }
    int NR = get_nr(R, 0);
    if (NR == -1) return;
    cend(NR);
}

void solve ()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++) {
        adj[i].clear();
        blk[i] = false;
    }
    for(int i=1;i<=n;i++) {
        for(int j=0;j<2;j++) {
            int T;
            scanf("%d",&T);
            if(T) {
                adj[i].push_back(T);
                adj[T].push_back(i);
            }
        }
    }
    cend(1);
}

int main()
{
    //ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc;
    scanf("%d",&tc);
    while(tc--) {
        solve();
    }
}