#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>

using namespace std;

typedef long long ll;

struct rmqsegtree{
  vector< pair<int, int> > t; //<data, at>
  pair<int, int> re;
  int n;
  void dflt(void){ re.first = 2147483647; re.second = -1; return; }
  void use(void){
    int i; dflt();
    for(i = 0;;++i)if((1 << i) >= n)break;
    ++i; t.resize(1 << i); t[0].first = 1 << (i - 1); t[0].second = 1 << i;
    for(i = 1;i < t[0].second;++i)t[i] = re;
    for(i = 0;i < n;++i)t[i + t[0].first].second = i;
    return;
  }
  void build(vector<int> a){
    for(n = 1;;n <<= 1)if(n >= a.size())break;
    t.resize(n << 1); dflt();
    t[0].first = n; t[0].second = t[0].first << 1; n = a.size();
    for(int i = 1;i < t[0].second;++i)t[i] = re;
    for(int i = 0;i < n;++i){
      t[t[0].first + i].first = a[i]; t[t[0].first + i].second = i;
    }
    for(int i = t[0].first - 1;i >= 1;--i)
      t[i] = (t[i << 1] <= t[(i << 1) + 1]) ? t[i << 1] : t[(i << 1) + 1];
    return;
  }
  void update(int at, int data){
    t[t[0].first + at].first = data;
    for(int x = t[0].first + at;x > 1;){
      x >>= 1;
      if(t[x << 1].first <= t[(x << 1) + 1].first)t[x] = t[x << 1];
      else t[x] = t[(x << 1) + 1];
    }
    return;
  }
  pair<int, int> query(int l, int r, int k, int kl, int kr){
    if(l <= t[k].second && t[k].second < r)return t[k];
    if(k >= t.size())return re;
    if(kl >= r || kr <= l)return re;
    if(l <= kl && kr <= r)return t[k];
    pair<int, int> a = query(l, r, k << 1, kl, (kl + kr) >> 1);
    pair<int, int> b = query(l, r, (k << 1) + 1, (kl + kr) >> 1, kr);
    return (a.first < b.first) ? a : b;
  }
  pair<int, int> find(int l, int r){ return query(l, r, 1, 0, t[0].first); }
  void deb(void){
    int x = 1;
    printf("t[0] = (%d, %d)\n", t[0].first, t[0].second);
    for(int i = 1;i < t[0].second;++i){
      printf("%3d", t[i].first);
      if(i == (1 << x) - 1){ puts(""); ++x; }
    }
    x = 1;
    printf("t[0] = (%d, %d)\n", t[0].first, t[0].second);
    for(int i = 1;i < t[0].second;++i){
      printf("%3d", t[i].second);
      if(i == (1 << x) - 1){ puts(""); ++x; }
    }
    return;
  }
};

struct edge{
  int to, cost;
};

struct tree{
  vector< vector<edge> > t;
  int v;
  void nexttree(int x){ //x-indexed
    scanf("%d", &v);  t.resize(v);
    int from, to, cost = 1;
    for(int i = 1;i < v;++i){
      scanf("%d %d", &from, &to);
      t[from - x].push_back((edge){to - x, cost});
      t[to - x].push_back((edge){from - x, cost});
    }
    return;
  }
  void nexttree2(int x){
    scanf("%d", &v); t.resize(v);
    int k, to, cost = 1;
    for(int i = 0;i < v;++i){
      scanf("%d", &k);
      for(int j = 0;j < k;++j){
        scanf("%d", &to);
        t[i - x].push_back((edge){to - x, cost});
        t[to - x].push_back((edge){i - x, cost});
      }
    }
    return;
  }
  rmqsegtree S;
  vector<int> vst, dpth, id;
  void lcarmqdfs(int now, int dep){ //575!!
    id[now] = vst.size();
    vst.push_back(now); dpth.push_back(dep);
    for(int i = 0;i < t[now].size();++i)if(id[t[now][i].to] == -1){
      lcarmqdfs(t[now][i].to, dep + 1);
      vst.push_back(now); dpth.push_back(dep);
    }
    return;
  }
  void lcarmq(void){
    if(vst.size() > v)return;
    id.resize(v); for(int i = 0;i < v;++i)id[i] = -1;
    lcarmqdfs(0, 0);
    S.build(vst);
    return;
  }
  int lcaid(int a, int b){
    if(id[a] > id[b])swap(a, b);
    return vst[S.find(id[a], id[b] + 1).second];
  }
  int depth(int a){ return dpth[id[a]]; }
  int dist(int a, int b){ return depth(a) + depth(b) - 2 * depth(lcaid(a, b)); }
};

signed main(void){
  tree T; T.nexttree2(0);
  T.lcarmq();

  int q, a, b;
  scanf("%d", &q);
  for(;q--;){
    scanf("%d%d", &a, &b);
    printf("%d\n", T.lcaid(a, b));
  }

  return 0;
}

Measured memory_bytes: 16204