#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
constexpr int N(1e5+5);
vector<int>G[N];
int n,siz[N],centroid,maxw[N],S;
bool vis[N];
inline const void getSize(const int &u,const int &fa)
{
    siz[u]=1;
    for (const int &v:G[u])
        if (!vis[v]&&fa!=v)
            getSize(v,u),
            siz[u]+=siz[v];
}
inline const void getCentroid(const int &u,const int &fa)
{
    maxw[u]=0;
    for (const int &v:G[u])
        if (!vis[v]&&v!=fa)
            getCentroid(v,u),
            maxw[u]=max(maxw[u],siz[v]);
    maxw[u]=max(maxw[u],S-siz[u]);
    if (maxw[u]<maxw[centroid])centroid=u;
}
inline const void getCentroid(const int &u)
{
    getSize(u,0);
    maxw[centroid=0]=S=siz[u];
    getCentroid(u,0);
    getSize(centroid,0);
}
inline const bool cmp(const int &a,const int &b)
{
    return siz[a]>siz[b];
}
inline const void work()
{
    cin>>n;
    for (int lson,rson,i(1);i<=n;i++)
    {
        cin>>lson>>rson;
        if (lson)G[i].push_back(lson),G[lson].push_back(i);
        if (rson)G[i].push_back(rson),G[rson].push_back(i);
    }
    int root(1),f;
    while (1)
    {
        getCentroid(root);
        vector<int>adj;
        for (const int &p:G[centroid])if(!vis[p])adj.push_back(p);
        sort(adj.begin(),adj.end());
        if (S==1)
        {
            cout<<"! "<<centroid<<endl;
            break;
        }
        if (S==2)
        {
            cout<<"? "<<centroid<<" "<<adj.front()<<endl;
            cin>>f;
            cout<<"! "<<(f?adj.front():centroid)<<endl;
            break;
        }
        if (adj.size()==2)
        {
            cout<<"? "<<adj.front()<<" "<<adj.back()<<endl;
            cin>>f;
            if (f==1){cout<<"! "<<centroid<<endl;break;}
            vis[centroid]=1;
            root=f?adj.back():adj.front();
            continue;
        }
        cout<<"? "<<adj.front()<<" "<<adj[1]<<endl;
        cin>>f;
        if (f==1)
        {
            vis[adj.front()]=vis[adj[1]]=1;
            root=centroid;
            continue;
        }
        vis[centroid]=1;
        root=f?adj[1]:adj.front();
    }
    for (int i(1);i<=n;i++)vis[i]=0,G[i].clear();
}
int main()
{
    int T;cin>>T;
    while (T--)work();
    return 0;
}