#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=1e5+10;
vector<int> v[N];
int n,num,maxnum,root,d[N],ans[N];
bool vis[N];
void dfs(int u,int fa){
    d[u]=1;
    int tmp=0;
    for(auto i:v[u]){
        if(i==fa||vis[i]) continue;
        dfs(i,u);
        d[u]+=d[i];
        tmp=max(tmp,d[i]);
    }
    tmp=max(tmp,n-d[u]);
    if(tmp<maxnum){
        maxnum=tmp;
        num=0;
        ans[++num]=u;
    }else if(tmp==maxnum) ans[++num]=u;

}
void answer(int x){
    cout<<"! "<<x<<endl;
}
int query(int x,int y){
    cout<<"? "<<x<<" "<<y<<endl;
    int ret;
    cin >> ret;
    return ret;
}
int get_num(int u,int fa){
    int ret=1;
    for(auto j:v[u]){
        if(j==fa||vis[j])continue;
        ret+=get_num(j,u);
    }
    return ret;
}
bool work(){
    dfs(root,0);
    int tmp=0;
    vector<int> nxt;
  
    for(auto i:v[ans[1]]){
        if(!vis[i]) {
            tmp++;
            nxt.push_back(i);
        }
    }
    if(tmp==0){
        answer(ans[1]);
        return true;
    }else if(tmp==1){
        auto now=nxt[0];
        int op=query(ans[1],now);
        if(op==0){
            answer(ans[1]);
            return true;
        }
        if(op==2){
            answer(now);
            return true;
        }
    }else if(tmp==2){
        int op=query(nxt[0],nxt[1]);
        if(op==1){
            answer(ans[1]);
            return true;
        }else if(op==0){
            vis[ans[1]]=true;
            root=nxt[0];
        }else if(op==2){
            vis[ans[1]]=true;
            root=nxt[1];
        }
    }else if(tmp==3){
        vis[ans[1]]=true;
        int num1=get_num(nxt[0],0);
        int num2=get_num(nxt[1],0);
        int num3=get_num(nxt[2],0);

        vector<pair<int,int>> v;
        v.push_back({num1,nxt[0]});
        v.push_back({num2,nxt[1]});
        v.push_back({num3,nxt[2]});
        sort(v.begin(),v.end(),greater<pair<int,int>>());
        int op=query(v[0].second,v[1].second);
        if(op==0){
            root=v[0].second;
        }else if(op==2){
            root=v[1].second;
        }else if(op==1){
            vis[ans[1]]=false;
            vis[v[0].second]=true;
            vis[v[1].second]=true;
            root=ans[1];
            
        }
    }
    return false;
}

void solve(){
    cin >> n;
    for(int i=1;i<=n;++i) {
        vis[i]=false;
        v[i].clear();
    }
    num=0;
    maxnum=1e9;
    root=1;
    for(int i=1;i<=n;++i){
        int l,r;
        cin >> l >> r;
        if(l) v[i].push_back(l),v[l].push_back(i);
        if(r) v[i].push_back(r),v[r].push_back(i);
    }
    while(true){
        for(int i=1;i<=n;++i) d[i]=0;
        ans[1]=0;
        ans[2]=0;
        num=0;
        maxnum=1e9;
        if(work()) break;
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}