#include <bits/stdc++.h>

using namespace std;

const int N = 2e5+;

int n, cnt, tot, dp[N][]; // dp[i][j] [i, i+(1<<j)-1]

vector<int> G[N]; map<string ,int> mp;

string s1,s2,s[N];

int dfn[N], id[N], dep[N];

int getId(string str)

{

    if(mp[str])

        return mp[str];

    mp[str] = ++cnt;

    s[cnt] = str;

    return cnt;

}

void dfs(int u,int fa,int d)

{

    id[u] = tot;

    dfn[tot] = u;

    dep[tot++] = d;

    for(int i=; i<G[u].size(); i++) {

        int v = G[u][i];

        dfs(v, u, d+);

        dfn[tot] = u;

        dep[tot++] = d;

    }

    return ;

}

void st_init(int sz)

{

    for(int i=; i<=sz; i++)

        dp[i][] = i;

    for(int j=; (<<j)<=sz; j++)

    {

        for(int i=; i+(<<j)-<=sz; i++)

        {

            int x = dp[i][j-];

            int y = dp[i+(<<(j-))][j-];

            if(dep[x] < dep[y])

                dp[i][j] = x;

            else

                dp[i][j] = y;

        }

    }

}

void init()

{

    tot = ;

    dfs(, , );

    st_init(tot-);

}

int query(int u,int v)

{

    u = id[u], v = id[v];

    if(v < u)

        swap(v,u);

    int t = log2(v-u+);

    int x = dp[u][t];

    int y = dp[v-(<<t)+][t];

    if(dep[x] < dep[y])

        return x;

    else

        return y;

}

int main()

{

    freopen("in.txt","r",stdin);

    ios::sync_with_stdio();

    cin >> n;

    for(int i=; i<n; i++) {

        cin >> s1 >> s2;

        int u = getId(s1);

        int v = getId(s2);

        G[u].push_back(v);

    }

    init();

    int m; cin >> m;

    for(int i=; i<m; i++) {

        cin >> s1 >> s2;

        int u = getId(s1);

        int v = getId(s2);

        int x = dfn[query(u,v)];

        cout << s[x] <<"\n";

    }

    return ;

}