#include <bits/stdc++.h>
using namespace std;

bool Memory_begin;

bool Memory_end;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cerr << (&Memory_end - &Memory_begin) / 1048576.0 << "MB" << '\n';

    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        vector<vector<int>> adj(n + 1);
        for (int i = 1, x, y; i <= n; i++)
        {
            cin >> x >> y;
            if (x)
                adj[i].push_back(x), adj[x].push_back(i);
            if (y)
                adj[i].push_back(y), adj[y].push_back(i);
        }
        vector<int> vis(n + 1);

        int sum = n;
        while (sum > 1)
        {
            vector<int> dep(n + 1), siz(n + 1);
            auto dfs1 = [&](auto &dfs1, int cur, int fa, int sum) -> int
            {
                siz[cur] = 1;
                int mx = 0;
                for (int i : adj[cur])
                {
                    if (i == fa or vis[i])
                        continue;
                    int tmp = dfs1(dfs1, i, cur, sum);
                    if (tmp)
                        return tmp;
                    siz[cur] += siz[i];
                    mx = max(mx, siz[i]);
                }
                mx = max(mx, sum - siz[cur]);
                if (mx * 2 <= sum)
                    return cur;
                return 0;
            };
            auto dfs2 = [&](auto &dfs2, int cur, int fa) -> void
            {
                dep[cur] = dep[fa] + 1;
                for (int i : adj[cur])
                {
                    if (vis[i] or i == fa)
                        continue;
                    dfs2(dfs2, i, cur);
                }
            };
            for (int i = 1; i <= n; i++)
            {
                if (vis[i])
                    continue;
                int cur = dfs1(dfs1, i, 0, sum);
                int p1 = adj[cur][0], p2 = adj[cur].size() == 1 ? cur : adj[cur][1];
                dfs2(dfs2, p1, 0);
                auto dep1 = dep;
                dfs2(dfs2, p2, 0);
                auto dep2 = dep;
                cout << "? " << p1 << ' ' << p2 << endl;
                int tmp;
                cin >> tmp;
                for (int j = 1; j <= n; j++)
                {
                    if (vis[j])
                        continue;
                    if (tmp == 0 and dep1[j] >= dep2[j])
                        vis[j] = 1, sum--;
                    else if (tmp == 1 and dep1[j] != dep2[j])
                        vis[j] = 1, sum--;
                    else if (tmp == 2 and dep1[j] <= dep2[j])
                        vis[j] = 1, sum--;
                }
                break;
            }
        }

        for (int i = 1; i <= n; i++)
        {
            if (!vis[i])
            {
                cout << "! " << i << endl;
                break;
            }
        }
    }
}
/*
 */