#include<bits/stdc++.h>
#ifdef LOCAL
#define debug(...) printf(__VA_ARGS__)
#define edebug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#define edebug(...)
#endif
#define int ll
#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define nrep(i, x, y) for(int i = x; i >= y; --i)
#define ll long long
#define pii std::pair<int,int>
#define pb emplace_back
#define fi first
#define se second
template <class T> 
inline void ckmax(T &a, T b) {
  if(a < b) a = b;
}
template <class T> 
inline void ckmin(T &a, T b) {
  if(a > b) a = b;
}
auto rt_YES = []{puts("YES");};
auto rt_Yes = []{puts("Yes");};
auto rt_NO = []{puts("NO");};
auto rt_No = []{puts("No");};
namespace IO {
#define isdigit(x) (x >= '0' && x <= '9')
  inline char gc() {
    return getchar();
  }
  inline bool blank(char ch) {
    return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
  }
  template <class T>
  inline void read(T &x) {
    double tmp = 1;
    bool sign = 0;
    x = 0;
    char ch = gc();
    for(; !isdigit(ch); ch = gc())
      if(ch == '-') sign = 1;
    for(; isdigit(ch); ch = gc())
      x = x * 10 + (ch - '0');
    if(ch == '.')
      for(ch = gc(); isdigit(ch); ch = gc())
        tmp /= 10.0, x += tmp * (ch - '0');
    if(sign) x = -x;
  }
  inline void read(char *s) {
    char ch = gc();
    for(; blank(ch); ch = gc());
    for(; !blank(ch); ch = gc())
      *s++ = ch;
    *s = 0;
  }
  inline void read(char &c) {
    for(c = gc(); blank(c); c = gc());
  }
  inline void push(const char &c) {
    putchar(c);
  }
  template <class T>
  inline void print(T x) {
    if(x < 0) {
      x = -x;
      push('-');
    }
    static T sta[35];
    T top = 0;
    do {
      sta[top++] = x % 10;
      x /= 10;
    } while(x);
    while(top)
      push(sta[--top] + '0');
  }
  template <class T>
  inline void print(T x, char lastChar) {
    print(x);
    push(lastChar);
  }
}
using namespace IO;

int l[100010],r[100010],sz[100010],fa[100010],root,vis[100010];
std::vector<int>exist;
int ask(int u,int v){
  std::cout<<"? "<<u<<' '<<v<<std::endl;
  int ans;read(ans);return ans;
}
void ans(int u){
  std::cout<<"! "<<u<<std::endl;
}
void dfs(int u,int f){
  fa[u]=f,sz[u]=1;exist.pb(u);
  if(l[u])dfs(l[u],u),sz[u]+=sz[l[u]];
  if(r[u])dfs(r[u],u),sz[u]+=sz[r[u]];
}
void solve(){
  int n;read(n);
  rep(i,1,n)vis[i]=0;
  rep(i,1,n)read(l[i]),read(r[i]),vis[l[i]]=vis[r[i]]=1;
  rep(i,1,n)if(!vis[i])root=i;
  while(1){
    exist.clear();
    if(!l[root]&&!r[root]){ans(root);break;}
    dfs(root,0);n=sz[root];
    if(n==2){
      if(l[root]){
        int T=ask(root,l[root]);
        if(T==0)ans(root);
        else ans(l[root]);
      }
      else{
        int T=ask(root,r[root]);
        if(T==0)ans(root);
        else ans(r[root]);
      }
      return;
    }
    for(int&i:exist){
      int szl=0,szr=0,szi=0;
      if(l[i])szl=sz[l[i]];
      if(r[i])szr=sz[r[i]];
      if(!l[i]&&!r[i])continue;
      if(!l[i]&&!fa[i])continue;
      if(!r[i]&&!fa[i])continue;
      if(szl&&std::__lg(szl)==std::__lg(n))continue;
      if(szr&&std::__lg(szr)==std::__lg(n))continue;
      szi=n-szl-szr-1;
      if(szi&&std::__lg(szi)==std::__lg(n))continue;
      if(!l[i]){
        int T=ask(r[i],fa[i]);
        if(T==1){ans(i);return;}
        if(T==0){root=r[i];break;}
        if(T==2){
          if(l[fa[i]]==i)l[fa[i]]=0;
          else r[fa[i]]=0;
          break;
        }
      }else if(!r[i]){
        int T=ask(l[i],fa[i]);
        if(T==1){ans(i);return;}
        if(T==0){root=l[i];break;}
        if(T==2){
          if(l[fa[i]]==i)l[fa[i]]=0;
          else r[fa[i]]=0;
          break;
        }
      }else if(std::__lg(szi+1)==std::__lg(n)){
        if(szl>szr){
          int T=ask(l[i],fa[i]);
          if(T==1){
            root=i,l[i]=0;
            break;
          }
          if(T==0){root=l[i];break;}
          if(T==2){
            if(l[fa[i]]==i)l[fa[i]]=0;
            else r[fa[i]]=0;
            break;
          }
        }
        else{
          int T=ask(r[i],fa[i]);
          if(T==1){
            root=i,r[i]=0;
            break;
          }
          if(T==0){root=r[i];break;}
          if(T==2){
            if(l[fa[i]]==i)l[fa[i]]=0;
            else r[fa[i]]=0;
            break;
          }
        }
      }else{
        int T=ask(l[i],r[i]);
        if(T==0){root=l[i];break;}
        if(T==2){root=r[i];break;}
        if(T==1){l[i]=r[i]=0;break;}
      }
    }
    for(int&i:exist)sz[i]=0;
  }
}

signed main() {
  clock_t c1 = clock();
#ifdef LOCAL
  // freopen("in.in", "r", stdin);
  // freopen("out.out", "w", stdout);
#endif
//------------------------------------------------------------------

  int t;read(t);while(t--)solve();

//------------------------------------------------------------------
end:
  std::cerr << "Time : " << clock() - c1 << " ms" << std::endl;
  return 0;
}