#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

template<typename T> class SparseTable {
private:
    vector<T> Arr;
    vector<int> LogTable;
    vector<vector<int> > Table; //最小値のインデックスを保持
    int sz;
public:
    void resize(vector<T>& v){
        sz = (int)v.size();
        Arr = v;
        LogTable.resize(sz+1);
        for(int i = 2; i < sz + 1; i++){
            LogTable[i] = LogTable[i >> 1] + 1;
        }
        Table.resize(sz,vector<T>(LogTable[sz]+1));
        rep(i,sz){
            Table[i][0] = i;
        }
        for(int k = 1; (1 << k) <= sz; k++){
            for(int i = 0; i + (1 << k) <= sz; i++){
                int s = Table[i][k-1];
                int t = Table[i + (1 << (k-1))][k-1];
                if(Arr[s] < Arr[t]){
                    Table[i][k] = s;
                }else{
                    Table[i][k] = t;
                }
            }
        }
    }
    pair<T,int> query(int l,int r){
        int k = LogTable[r-l];
        if(Arr[Table[l][k]] < Arr[Table[r-(1<<k)][k]]){
            return make_pair(Arr[Table[l][k]],Table[l][k]);
        }else{
            return make_pair(Arr[Table[r-(1<<k)][k]],Table[r-(1<<k)][k]);
        }
    }
};

class LCA{
public:
    vector<int> ord,depth,id;
    vector<vector<int> > G;
    SparseTable<int> st;
    int V;
    LCA(int node_size){
        V = node_size;
        G.resize(V),depth.resize(V),id.resize(V,-1);
    }
    void add_edge(int from,int to){
        G[from].push_back(to),G[to].push_back(from);
    }
    void dfs(int u,int p,int k){
        id[u] = (int)ord.size();
        ord.push_back(u);
        depth[u] = k;
        rep(i,G[u].size()){
            if(G[u][i] != p){
                dfs(G[u][i],u,k+1);
                ord.push_back(u);
            }
        }
    }
    void build(){
        rep(i,V){
            if(id[i] < 0){
                dfs(i,-1,0);
            }
        }
        vector<int> stvec((int)ord.size());
    	rep(i,ord.size()){
    		stvec[i] = depth[ord[i]];
    	}
        st.resize(stvec);
    }
    int solve(int u,int v){
        return ord[st.query(min(id[u],id[v]),max(id[u],id[v])+1).second];
    }
    int dist(int u,int v){
        int lca = solve(u,v);
        return depth[u] + depth[v] - 2*depth[lca];
    }
};

vector<int> G[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
	LCA lca(n);
	rep(i,n){
		int cnt;
		cin >> cnt;
		rep(j,cnt){
			int a;
			cin >> a;
			lca.add_edge(i,a);
		}
	}
	lca.build();
	int q;
	cin >> q;
	rep(i,q){
		int a,b;
		cin >> a >> b;
		cout << lca.solve(a,b) << "\n";
	}
    return 0;
}



Measured memory_bytes: 37100