#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 mod = 998244353;
vector<vector<int>> con;
vector<int> ctr; // 重心
const int maxn = 2e5 + 9;
int n, m, allsz;
int sz[maxn], mss[maxn], fa[maxn];
int disjfa[maxn];
void init(int n)
{
    for (int i = 1; i <= n; i++)
        disjfa[i] = i;
}
int find(int x)
{
    return disjfa[x] == x ? x : disjfa[x] = find(disjfa[x]);
}
void merge(int x, int y)
{
    x = find(x), y = find(y);
    if (x != y)
        disjfa[x] = y;
}
void dfs(int u, int f, bool tag)
{
    fa[u] = f;
    sz[u] = 1, mss[u] = 0;
    if (tag)
    {
        auto it = find(con[u].begin(), con[u].end(), f);
        if (it != con[u].end())
            con[u].erase(it);
    }
    if (!con[u].empty())
        for (auto v : con[u])
        {
            dfs(v, u, tag);
            sz[u] += sz[v];
            mss[u] = max(mss[u], sz[v]);
        }
    mss[u] = max(mss[u], allsz - sz[u]);
    if (mss[u] <= allsz / 2)
    {
        ctr.push_back(u);
    }
} // 搜重心
void solve()
{
    cin >> n;
    init(n);
    con.assign(n + 1, vector<int>());
    ctr.clear();
    int rt = -1;
    for (int i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        if (l)
        {
            con[i].push_back(l);
            merge(l, i);
        }
        if (r)
        {
            con[i].push_back(r);
            merge(r, i);
        }
    }
    for (int i = 1; i <= n; i++)
        if (find(i) == i)
        {
            rt = i;
            break;
        }
    function<int(int, int)> ask = [&](int l, int r) -> int
    {
        cout << "? " << l << " " << r << '\n';
        cout.flush();
        int x;
        cin >> x;
        return x;
    };
    allsz = n;
    dfs(rt, 0, 1);
    int mid = ctr[0];
    while (sz[rt] > 1)
    {
        if (con[mid].size() == 2)
        {
            int l = con[mid][0], r = con[mid][1];
            int sig = ask(l, r);
            if (sig == 0)
            {
                ctr.clear();
                allsz = sz[l];
                dfs(rt = l, 0, 0);
                mid = ctr[0];
            }
            else if (sig == 2)
            {
                ctr.clear();
                allsz = sz[r];
                dfs(rt = r, 0, 0);
                mid = ctr[0];
            }
            else
            {
                allsz -= (sz[l] + sz[r]);
                ctr.clear();
                con[mid].clear();
                dfs(rt, 0, 0);
                mid = ctr[0];
            }
        }
        else
        {
            int l = mid, r = fa[mid];
            int sig = ask(l, r);
            if (sig == 0)
            {
                ctr.clear();
                allsz = sz[l];
                dfs(rt = l, 0, 0);
                mid = ctr[0];
            }
            else
            {
                auto it = find(con[r].begin(), con[r].end(), l);
                if (it != con[r].end())
                    con[r].erase(it);
                ctr.clear();
                allsz -= sz[l];
                dfs(rt, 0, 0);
                mid = ctr[0];
            }
        }
    }
    cout << "! " << rt << " " << '\n';
    cout.flush();
}

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