#include<iostream>
#include<queue>
#include<cstring>
#include<tuple>
//~FZY.//
#include<bits/stdc++.h>
#define Heap_int priority_queue<int, vector<int>, greater<int>>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define out(x) cout << ((x) ? "YES" : "NO") << endl
#define mod(x, P) (((x) % (P) + (P)) % (P))
//#define mod(x) (((x) % (P) + (P)) % (P))
#define ULL unsigned long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define lowbit(x) ((x) & -(x))
#define LL long long
#define pb push_back
#define gcd __gcd
#define Big __int128
//#define endl "\n"
#define x first
#define y second
//#define int LL
using namespace std;
const int N = 2e5 + 10, M = 2e6 + 10, INF = 1e9 + 7, P = 998244353;
vector<int>a[N];
int g[N],dp[N],hd,sum,mi=P;
void as(int u,int fa)
{
    sum++;
    for(auto i:a[u])
    {
        if(i!=fa&&!g[i])
        as(i,u);
    }
}
void dfs(int u,int fa)
{
    dp[u]=1;
    int ma=0;
    for(auto i:a[u])
    {
      if(i!=fa&&!g[i])
      {
        dfs(i,u);
        dp[u]+=dp[i];
        ma=max(ma,dp[i]);
      }
    }
    ma=max(ma,sum-dp[u]);
    if(ma<mi)
    mi=ma,hd=u;
}
void dfs1(int u)
{
    mi=P,sum=0;
    as(u,0);
    dfs(u,0);
    vector<int>q;
    for(auto i:a[hd])
    {
        if(!g[i])
        q.push_back(i);
    }
    if(!q.size())
    cout<<"!"<<" "<<hd<<endl;
    else if(q.size()==1)
    {
        cout<<"?"<<" "<<q[0]<<" "<<hd<<endl;
        int x;
        cin>>x;
        if(x==0)
        cout<<"!"<<" "<<q[0]<<endl;
        else
        cout<<"!"<<" "<<hd<<endl;
        return;
    }
    else if(q.size()==2)
    {
        cout<<"?"<<" "<<q[0]<<" "<<q[1]<<endl;
        int x;
        cin>>x;
        if(x==0)
        {
            g[hd]++;
            dfs1(q[0]);
        }
        else if(x==1)
        {
            cout<<"!"<<" "<<hd<<endl;
            return;
        }
        else
        {
            g[hd]++;
            dfs1(q[1]);
        }
    }
    else
    {
      cout<<"?"<<" "<<q[0]<<" "<<q[1]<<endl;
        int x;
        cin>>x;
        if(x==0)
        {
            g[hd]++;
            dfs1(q[0]);
        }
        else if(x==1)
        {
            g[q[0]]++,g[q[1]]++;
            dfs1(hd);
        }
        else
        {
            g[hd]++;
            dfs1(q[1]);
        }
    }
}
void solve(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int u,v;
        cin>>u>>v;
        if(u)
        {
            a[u].push_back(i);
            a[i].push_back(u);
        }
        if(v)
        {
            a[v].push_back(i);
            a[i].push_back(v);
        }
    }
    dfs1(1);
    for(int i=1;i<=n;i++)
    a[i].clear(),g[i]=0;
}
signed main(){
    IOS;

    int T = 1;
    cin >> T;
    while(T--){
        solve();
    }
    return 0;
}