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

void printans(int x){
    cout << "! " << x + 1 << endl;
}

int query(int a, int b){
    cout << "? " << a + 1 << " " << b + 1 << endl;
    int ans;
    cin >> ans;
    return ans;
}

void dfs(int head, int d, vector<vector<int>> &tree, vector<int> &dist, set<int> &in){
    dist[head] = d;
    for(int i : tree[head]){
        if(!dist[i] && in.count(i)){
            dfs(i, d + 1, tree, dist, in);
        }
    }
}

void rec(int N, vector<vector<int>> tree, set<int> in){
    assert(in.size());
    if(in.size() == 1){
        printans(*in.begin());
        return;
    }
    vector<int> d(N), d1(N), d2(N);
    dfs(*in.begin(), 1, tree, d, in);
    int a = max_element(d.begin(), d.end()) - d.begin();
    dfs(a, 1, tree, d1, in);
    int b = max_element(d1.begin(), d1.end()) - d1.begin();
    dfs(b, 1, tree, d2, in);
    // cerr << "AB " << a << " " << b << " " << *max_element(d.begin(), d.end()) << " " << *max_element(d1.begin(), d1.end()) << endl;
    if(d1[b] % 2 == 0 && in.size() > 2){
        int dst = d1[b];
        for(int i : in){
            if(d1[i] + 1 == dst){
                b = i;
                fill(d2.begin(), d2.end(), 0ll);
                dfs(i, 1, tree, d2, in);
                break;
            }
        }
    }
    int r = query(a, b);
    set<int> nin;
    if(r == 1){
        for(int i : in){
            if(d1[i] == d2[i]){
                nin.insert(i);
            }
        }
    }
    else if(r == 0){
        for(int i : in){
            if(d1[i] < d2[i]){
                nin.insert(i);
            }
        }
    }
    else{
        for(int i : in){
            if(d1[i] > d2[i]){
                nin.insert(i);
            }
        }
    }
    rec(N, tree, nin);
}

void solve(){
    int N;
    cin >> N;
    vector<vector<int>> tree(N);
    set<int> in;
    for(int i = 0; i < N; i ++){
        int a, b;
        in.insert(i);
        cin >> a >> b;
        if(a){
            tree[i].push_back(a - 1);
            tree[a - 1].push_back(i);
        }
        if(b){
            tree[i].push_back(b - 1);
            tree[b - 1].push_back(i);
        }
    }
    rec(N, tree, in);
}

signed main(){
	int t = 1;
	cin >> t;
	while(t--)solve();
	return 0;
}