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

using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n) for(int i=0;i<(n);++i)
#define sizc(x) ((int)(x).size())
#define allc(x) (x).begin(),(x).end()
#define fir first
#define sec second

constexpr int N = 1e5+5;

int n;
vector<int> G[N];

int sz[N],f[N],su,rt;
bool vis[N];
void grt(int u,int fa){
    sz[u]=1,f[u]=0;
    for(auto v:G[u]){
        if(v==fa||vis[v])continue;
        grt(v,u);
        sz[u]+=sz[v];
        f[u]=max(f[u],sz[v]);
    }
    f[u]=max(f[u],su-sz[u]);
    if(f[u]<f[rt])rt=u;
}
void solve(){
    cin>>n;
    rep(i,1,n)G[i].clear();
    rep(i,1,n){
        int x,y;cin>>x>>y;
        if(x)G[i].push_back(x),G[x].push_back(i);
        if(y)G[i].push_back(y),G[y].push_back(i);
    }
    rep(i,1,n)vis[i]=0;
    su=f[0]=n,rt=0;
    grt(1,0),grt(rt,0);
    while(true){
        vector<int> son;
        for(auto v:G[rt])if(!vis[v])son.push_back(v);
        if(son.empty()){
            cout<<"! "<<rt<<endl;
            return;
        }
        if(son.size()==1){
            cout<<"? "<<rt<<' '<<son[0]<<endl;
            int t;cin>>t;
            cout<<"! "<<(t?son[0]:rt)<<endl;
            return;
        }
        sort(allc(son),[&](int x,int y){return sz[x]>sz[y];});
        cout<<"? "<<son[0]<<' '<<son[1]<<endl;
        int t;cin>>t;
        int p;
        if(t==0){
            vis[rt]=1,p=son[0],su=sz[son[0]];
        }
        if(t==1){
            vis[son[0]]=vis[son[1]]=1;
            p=rt,su=sz[son[2]]+1;
        }
        if(t==2){
            vis[rt]=1,p=son[1],su=sz[son[1]];
        }
        f[0]=su,rt=0;
        grt(p,0),grt(rt,0);
    }
}

signed main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    int T;cin>>T;
    while(T--)solve();
}