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

void solve()
{
    int n;
    cin >> n;

    set<int> st;
    for (int i = 1; i <= n; i++)
        st.insert(i);

    vector<set<int>> g(n + 10, set<int>());
    for (int i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        if (l)
        {
            g[i].insert(l);
            g[l].insert(i);
            st.erase(l);
        }
        if (r)
        {
            g[i].insert(r);
            g[r].insert(i);
            st.erase(r);
        }
    }

    if (st.empty())
    {
        cout << "! 1" << endl;
        return;
    }
    int root = *st.begin();

    if (g[root].empty())
    {
        cout << "! 1" << endl;
        return;
    }
    int u = root, v = *(g[root].begin());
    while (1)
    {
        cout << "? " << u << ' ' << v << endl;

        int t;
        cin >> t;
        if (t == 2)
            swap(u, v);

        g[u].erase(v);
        g[v].erase(u);

        if (g[u].empty())
        {
            cout << "! " << u << endl;
            return;
        }

        v = *(g[u].begin());
    }
}

signed main()
{
    // cin.tie(0)->ios::sync_with_stdio(false);

    int t = 1;
    cin >> t;
    while (t--)
        solve();

    return 0;
}