#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<(ll)b;i++)
#define bFor(i,a,b) for(i=a;i>=(ll)b;i--)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N-1,0)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define pb push_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
const ll mod=1000000007;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} 
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} 

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas& x,ddatas& y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n){
  ll res=1;
  while(n){
    if(n&1)res=res*a%mod;
    a=a*a%mod;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}
struct LowestCommonAncestor{
  ll N,K=0;
  mat g,parlis;
  vec dist,vis;
  LowestCommonAncestor(mat& t){
    g=t;
    N=t.size();
    dist.resize(N);
    vis.resize(N,0);
    while(N){N>>=1;K++;}
    N=dist.size();
    parlis.resize(N,vec(K));
  }
  void dfs(ll now,ll d){
    dist[now]=d;
    vis[now]=1;
    for(auto x:g[now]){
      if(vis[x])continue;
      dfs(x,d+1);
      parlis[x][0]=now;
    }
  }
  void init(ll par){
    dfs(par,0);
    parlis[par][0]=-1;
    ll i,j;
    rep(i,N)rep1(j,K){
      if(parlis[i][j-1]==-1){
        parlis[i][j]=-1;
        continue;
      }
      parlis[i][j]=parlis[parlis[i][j-1]][j-1];
    }
  }
  ll lca(ll a,ll b){
    if(dist[a]<dist[b])swap(a,b);
    ll i;
    if(dist[a]!=dist[b])brep(i,K){
      if((dist[a]-dist[b])&(1<<i))a=parlis[a][i];
    }
    if(a==b)return a;
    brep(i,K){
      if(parlis[a][i]!=parlis[b][i]){
        a=parlis[a][i];
        b=parlis[b][i];
      }
    }
    return parlis[a][0];
  }
};
int main(){
  startupcpp();
  ll i,N,K,x,u,v;
  cin>>N;
  mat g(N);
  rep(i,N){
    cin>>K;
    while(K--){
      cin>>x;
      g[i].pb(x);
      g[x].pb(i);
    }
  }
  LowestCommonAncestor tree(g);
  tree.init(0);
  cin>>N;
  while(N--){
    cin>>u>>v;
    print(tree.lca(u,v));
  }
}


Measured memory_bytes: 35912