#line 1 "G.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/home/sigma/comp/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
#line 5 "G.cpp"
using P = pair<int,int>;

void answer(int v){
	cout << "! " << v+1 << endl;
}
int ask(int x, int y){
	cout << "? " << x+1 << " " << y+1 << endl;
	int t; cin >> t; return t;
}

void solve(){
	int N; cin >> N;	
	VV<int> G(N);
	rep(i,N){
		rep(_,2){
			int c; cin >> c; c--;
			if(c == -1) continue;
			G[i].pb(c); G[c].pb(i);
		}
	}
	auto get_dist = [&](int r) -> V<int> {
		V<int> dist(N);
		auto dfs = [&](auto self, int v, int p, int d) -> void {
			dist[v] = d;
			for(int u : G[v]) if(u != p){
				self(self,u,v,d+1);
			}
		};
		dfs(dfs,r,-1,0);
		return dist;
	};
	V<bool> on(N,true);
	while(true){
		int num_on = count(all(on),true);
		show(num_on);
		if(num_on == 1){
			answer(find(all(on),true)-on.begin());
			return;
		}
		V<int> sz(N);
		V<int> par(N);
		auto dfs = [&](auto self, int v, int p) -> void {
			par[v] = p;
			sz[v] = on[v] ? 1 : 0;
			for(int u : G[v]) if(u != p){
				self(self,u,v);
				sz[v] += sz[u];
			}
		};
		dfs(dfs,0,-1);
		rep(x,N) if(on[x]){
			for(auto y: G[x]) if(on[y] && y != par[x]){
				int Y = sz[y], X = num_on - Y;
				if(max(X,Y) <= num_on/2){
					int t = ask(x,y);
					assert(t != 1);
					auto d0 = get_dist(x);
					auto d1 = get_dist(y);
					rep(v,N) if(on[v]){
						if(t==0 && d0[v] > d1[v]) on[v] = false;
						if(t==2 && d0[v] < d1[v]) on[v] = false;
					}
					goto done;
				}
			}
		}
		rep(r,N) if(on[r]){
			for(auto x: G[r]) if(on[x] && x != par[r]){
				for(auto y: G[r]) if(on[y]){
					if(x == y) continue;
					if(y != par[r]){
						// r -> x,y
						int X = sz[x], Y = sz[y], R = num_on - X - Y;
						if(max({X,Y,R}) <= num_on/2){
							int t = ask(x,y);
							auto d0 = get_dist(x);
							auto d1 = get_dist(y);
							rep(v,N){
								bool valid = false;
								if(t == 0 && d0[v] < d1[v]) valid = true;
								if(t == 1 && d0[v] == d1[v]) valid = true;
								if(t == 2 && d0[v] > d1[v]) valid = true;
								on[v] = on[v] && valid;
							}
							goto done;
						}
					}else{
						// y -> r -> x
						int X = sz[x], R = sz[r] - X, Y = num_on - X - R;
						if(max({X,Y,R}) <= num_on/2){
							int t = ask(x,y);
							auto d0 = get_dist(x);
							auto d1 = get_dist(y);
							rep(v,N){
								bool valid = false;
								if(t == 0 && d0[v] < d1[v]) valid = true;
								if(t == 1 && d0[v] == d1[v]) valid = true;
								if(t == 2 && d0[v] > d1[v]) valid = true;
								on[v] = on[v] && valid;
							}
							goto done;
						}
					}
				}
			}
		}
		assert(false);
		done:;
	}
}

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