#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <random>
#include <iomanip>
#include <unordered_set>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<pair<ll,ll> > vpll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int,int> mii;
typedef set<int> si;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define arep(i,v) for(auto i : v)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define fi first
#define se second
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
template <class T> inline void dump(T &v){irep(i, v){cout<<*i<<((i==--v.end())?'\n':' ');}}
inline string getline(){string s; getline(cin,s); return s;}
inline void yn(const bool b){b?fin("yes"):fin("no");}
inline void Yn(const bool b){b?fin("Yes"):fin("No");}
inline void YN(const bool b){b?fin("YES"):fin("NO");}
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
constexpr ll LLINF = 1LL<<60;
constexpr ll MOD = 1000000007;
constexpr double EPS = 1e-9;

class LCA {
    int n;
    static const int MAX = 20;
    vvi doubling, v;

    void init() {
        rep(i, n) {
            for(auto j : v[i]) {
                doubling[0][j] = i;
            }
        }
        for(int i = 1; i < MAX; i++) {
            rep(j, n) {
                doubling[i][j] = doubling[i - 1][doubling[i - 1][j]];
            }
        }
        depth[0] = 0;
        dfs(0, -1);
    }

    void dfs(const int crrPos, const int befPos) {
        for(auto i : v[crrPos]) {
            if(i == befPos || depth[i] != -1) {
                continue;
            }
            depth[i] = depth[crrPos] + 1;
            dfs(i, crrPos);
        }
    }

    // ダブリングでVのnum個親の祖先を調べる
    int doublingNode(int V, const int num) {
        rep(i, MAX) {
            if((1LL<<i) & num) {
                V = doubling[i][V];
            }
        }
        return V;
    }

public:
    vi depth;

    LCA(vvi &_v) : v(_v), n(_v.size()) {
        doubling = vvi(MAX, vi(n, 0));
        depth = vi(n, -1);
        init();
    }

    void show_doubling(const int height = MAX) {
        rep(i, height) {
            dump(doubling[i]);
        }
        dump(depth);
    }

    int lca(int A, int B) {
        // Aのが深い位置にあるようにする
        if(depth[A] < depth[B]) {
            swap(A, B);
        }
        A = doublingNode(A, depth[A] - depth[B]);
        if(A == B) {
            return A;
        }
        
        int ng = -1;
        int ok = depth[A] + 1;
        while(abs(ng - ok) > 1) {
            int mid = (ng + ok)/2;
            if(doublingNode(A, mid) != doublingNode(B, mid)) {
                ng = mid;
            }
            else ok = mid;
        }
        return  doublingNode(A, ng + 1);
    }
};

int main() {
    
    int n, Q, k, V, A, B;
    scanf("%d", &n);
    vvi v(n);
    
    rep(i, n) {
        scanf("%d", &k);
        rep(j, k) {
            scanf("%d", &V);
            v[i].pb(V);
        }
    }
    LCA lca(v);
    scanf("%d", &Q);
    rep(_, Q) {
        scanf("%d %d", &A, &B);
        printf("%d\n", lca.lca(A, B));
    }
}






Measured memory_bytes: 25164