#include<bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
 
const int N=2e5+10;
const int M=0x3f3f3f3f3f3f3f3f;
vector<int>e[N];
int a[N],b[N],vis[N];
int yu,n;

void f()
{
	queue<pair<int,int>>q;
	for(int i=1;i<=n;i++) if(e[i].size()==1) q.push({i,1});
	while(q.size())
	{
		int x=q.front().first,y=q.front().second;q.pop();
//		cerr<<x<<"\n";
		if(vis[x]!=0) continue;
		vis[x]=max(vis[x],y);
		for(auto i:e[x])
		{
			if(vis[i]==0) q.push({i,y+1});
		}
	}
}

signed main()
{
	// ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int T;cin>>T;
	while(T--)
	{
		cin>>n;int ans=1;
        for(int i=1;i<=n;i++) vis[i]=0,e[i].clear();
        for(int i=1;i<=n;i++)
        {
            int x,y;cin>>x>>y;
            a[i]=x;b[i]=y;
            if(y) 
            {
				e[i].push_back(y);
				e[y].push_back(i);
			}
            if(x) 
            {
				e[i].push_back(x);
				e[x].push_back(i);
			}
        }
		int u,v,t,la=0,mx=-1;
        int yui=floor(log2(n));
        f();
        for(int i=1;i<=n;i++) 
        {
        	if(vis[i]>mx) mx=vis[i],yu=i;
            else if(vis[i]==mx&&e[i].size()>e[yu].size()) yu=i;
//        	cerr<<vis[i]<<" ";
			vis[i]=0;
		}
//		cerr<<yu<<"\n";
        while(yui--)
        {
        	int sum=0;
        	for(auto i:e[yu]) if(vis[i]==0) sum++;
        	// sum=e[yu].size();
        	if(sum==0) {ans=u;break;}
        	else if(sum==1) 
        	{
				u=yu;
				for(auto i:e[yu]) if(vis[i]==0) v=i;
			}
			else if(sum==2) u=e[yu][0],v=e[yu][1];
        	else 
        	{
        		u=v=-1;
				for(auto i:e[yu]) 
				{
					if(vis[i]==0&&u==-1) 
					{
						u=i;
					}
					else if(vis[i]==0&&u!=-1) 
					{
						v=i;break;
					}
				}
                // u=e[yu][0],v=e[yu][1];
			}
        	vis[u]=vis[v]=1;
			// cout<<sum<<" ";
            cout<<"? "<<u<<" "<<v<<endl;
            cin>>t;
            if(sum==1)
            {
				if(t==0) {ans=u;break;}
				else {ans=v;break;}
			}
			else if(sum==2)
            {
				if(t==1) {ans=yu;break;}
				else if(t==0) yu=u,ans=u;
				else yu=v,ans=v;
			}
			else
			{
				if(t==0) yu=u,ans=u;
				else if(t==1) {vis[yu]=0;for(auto i:e[yu]) if(vis[i]==0) {yu=i,ans=i;break;}}
				else if(t==2) yu=v,ans=v;
			}
        }
        cout<<"! "<<ans<<"\n";
	}
	
	return 0;
}