#include "bits/stdc++.h"

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
    for (auto &e: vec) {
        is >> e;
    }
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) {
        cout << " ";
    }
    output(forward<Tail>(tail)...);
}

template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e: vec) {
        os << e << delim[&e == &vec.back()];
    }
    return os;
}

template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}
// End Header }}}

// Edge {{{
template <class Weight>
struct Edge {
    size_t from, to;
    Weight weight;

    Edge() {}
    Edge(size_t from, size_t to, Weight weight = 1) :
        from(from), to(to), weight(weight)
    {}

    bool operator<(const Edge &rhs) const {
        return weight < rhs.weight;
    }

    bool operator>(const Edge &rhs) const {
        return weight > rhs.weight;
    }

    operator size_t() const {
        return to;
    }
};
// }}}

// Graph {{{
template <class Weight>
class Graph : public vector<vector<Edge<Weight>>> {
    using graph = vector<vector<Edge<Weight>>>;

public:
    Graph() {}
    Graph(const size_t V) : graph(V) {}

    void connect(size_t from, size_t to, Weight weight = 1) {
        (*this)[from].emplace_back(from, to, weight);
    }

    friend ostream& operator<<(ostream &strm, const Graph &G) {
        for (size_t v = 0; v < G.size(); ++v) {
            strm << '[' << setw(2) << v << ']';
            for (const auto &e: G[v]) {
                strm << ' ' << setw(2) << e.to;
            }
            strm << '\n';
        }
        return strm;
    }
};
// }}}

// DoublingLCA {{{
template <class Weight>
class DoublingLCA {
public:
    const size_t V;
    const size_t LOG_V;
    Graph<Weight> G;
    vector<int> depth;
    vector<Weight> weightSum;
    vector<vector<int>> table;
    // table[k][v] := ノード v から根へ 2^k だけ移動した先のノード番号

    DoublingLCA(size_t n) :
        V(n),
        LOG_V(32 - __builtin_clz(V)), // ceil(log2(V))
        G(V),
        depth(V),
        weightSum(V),
        table(LOG_V, vector<int>(V, -1))
    {}

    // u - v 間に無向辺を張る
    void connect(size_t u, size_t v, Weight weight = 0) {
        G.connect(u, v, weight);
        G.connect(v, u, weight);
    }

    // 構築 O(V log(V))
    void build(size_t root) {
        dfs(root, -1, 0, 0);
        for (size_t k = 0; k + 1 < LOG_V; ++k) {
            for (size_t v = 0; v < V; ++v) {
                if (table[k][v] == -1) {
                    continue;
                }
                table[k + 1][v] = table[k][table[k][v]];
            }
        }
    }

    // u, v の最深共通祖先を求める O(log(V))
    size_t lca(size_t u, size_t v) {
        if (depth[u] > depth[v]) swap(u, v);
        for (int i = LOG_V - 1; i >= 0; --i) {
            if ((depth[v] - depth[u]) >> i & 1) {
                v = table[i][v];
            }
        }

        if (u == v) {
            return u;
        }

        for (int i = LOG_V - 1; i >= 0; --i) {
            if (table[i][u] != table[i][v]) {
                u = table[i][u];
                v = table[i][v];
            }
        }

        return table[0][u];
    }

    // v から根へ k だけ移動した先のノードを求める
    size_t climb(size_t v, size_t k) {
        size_t i = 0;
        while (k > 0) {
            if (k & 1) {
                v = table[i][v];
            }
            ++i;
            k >>= 1;
        }
        return v;
    }

    // u - v 間のパスの重みの和を求める
    Weight pathWeight(size_t u, size_t v) {
        return weightSum[u] + weightSum[v] - 2 * weightSum[lca(u, v)];
    }

    // u - v 間のパスの辺の本数 (長さ) を求める
    int pathLength(size_t u, size_t v) {
        return depth[u] + depth[v] - 2 * depth[lca(u, v)];
    }

private:
    void dfs(size_t cur, int p, int d, Weight w) {
        depth[cur] = d;
        weightSum[cur] = w;
        table[0][cur] = p;
        for (const auto &e: G[cur]) {
            if (e.to != p) {
                dfs(e.to, cur, d + 1, w + e.weight);
            }
        }
    }
};
// }}}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.setf(ios_base::fixed);
    cout.precision(10);
    var(size_t, N);
    DoublingLCA<size_t> G(N);
    rep(v, 0, N) {
        var(size_t, K);
        rep(j, 0, K) {
            var(size_t, u);
            G.connect(u, v);
        }
    }
    G.build(0);
    var(size_t, Q);
    while (Q--) {
        var(size_t, u, v);
        output(G.lca(u, v));
    }
    return 0;
}



Measured memory_bytes: 23864