#include <iostream>
using namespace std;
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <cstring>

using ll = long long;

const int N = 2e5 + 10;
int n;
vector<int> v[N];
bool st[N];
int sz[N], weight[N];

int dfs(int u, int fa)
{
	sz[u] = 1;
	weight[u] = 0;
	for (auto it : v[u])
	{
		if (it == fa) continue;
		if (st[it]) continue;
		int ans = dfs(it, u);
		if (ans != 0) return ans;
		sz[u] += sz[it];
		weight[u] = max(weight[u], sz[it]);
	}
	weight[u] = max(weight[u], n - sz[u]);
	// cout << weight[u] << ' ' << u << '\n';
	if (weight[u] <= n / 2) return u;
	return 0;
}

int mk(int u, int fa)
{
	st[u] = true;
	int res = 1;
	for (auto it : v[u])
	{
		if (it == fa) continue;
		if (st[it]) continue;
		res += mk(it, u);
	}
	return res;
}

int find(int u, int fa)
{
	int res = 1;
	//cout << u << ' ' << fa << '\n';
	for (auto it : v[u])
	{
		if (it == fa) continue;
		if (st[it]) continue;
		res += find(it, u);
	}
	return res;
}

void solve()
{
	cin >> n;
	for (int i = 1;i <= n;i++) v[i].clear();
	fill(st, st + 1 + n, 0);
	for (int i = 1;i <= n;i++)
	{
		int a, b;
		cin >> a >> b;
		if (a != 0) v[i].push_back(a), v[a].push_back(i);
		if (b != 0) v[i].push_back(b), v[b].push_back(i);
	}
	while (true)
	{
		fill(sz, sz + 1 + n, 0);
		fill(weight, weight + 1 + n, 0);
		int root = 1;
		while (st[root]) root++;
		root = dfs(root, -1);
		vector<int> ne;
		for (auto it : v[root])
			if (!st[it])
				ne.push_back(it);
		if (ne.size() == 0)
		{
			cout << "! " << root << '\n';
			cout.flush();
			return;
		}
		else if (ne.size() == 1)
		{
			cout << "? " << root << ' ' << ne[0] << '\n';
			cout.flush();
			int ans;
			cin >> ans;
			if (ans == 0) n -= mk(ne[0], root);
			else if (ans == 2) n -= mk(root, ne[0]);
		}
		else if (ne.size() == 2)
		{
			cout << "? " << ne[0] << ' ' << ne[1] << '\n';
			cout.flush();
			int ans;
			cin >> ans;
			if (ans == 0) n -= mk(root, ne[0]);
			else if (ans == 2) n -= mk(root, ne[1]);
			else
			{
				cout << "! " << root << '\n';
				cout.flush();
				return;
			}
		}
		else
		{
			int a = find(ne[0], root);
			int b = find(ne[1], root);
			int c = find(ne[2], root);
			if (c < a && c < b)
			{
				cout << "? " << ne[0] << ' ' << ne[1] << '\n';
				cout.flush();
				int ans;
				cin >> ans;
				if (ans == 0) n -= mk(root, ne[0]);
				else if (ans == 2) n -= mk(root, ne[1]);
				else
				{
					n -= mk(ne[0], root);
					n -= mk(ne[1], root);
				}
			}
			else if (b < a && b < c)
			{
				cout << "? " << ne[0] << ' ' << ne[2] << '\n';
				cout.flush();
				int ans;
				cin >> ans;
				if (ans == 0) n -= mk(root, ne[0]);
				else if (ans == 2) n -= mk(root, ne[2]);
				else
				{
					n -= mk(ne[0], root);
					n -= mk(ne[2], root);
				}
			}
			else
			{
				cout << "? " << ne[1] << ' ' << ne[2] << '\n';
				cout.flush();
				int ans;
				cin >> ans;
				if (ans == 0) n -= mk(root, ne[1]);
				else if (ans == 2) n -= mk(root, ne[2]);
				else
				{
					n -= mk(ne[1], root);
					n -= mk(ne[2], root);
				}
			}
		}
	}
}

int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int T = 1;
	cin >> T;
	while (T--)
	{
		solve();
	}
	return 0;
}