#include<bits/stdc++.h>
using namespace std;
int m,n,y;
int fa[100005];
int d[100005];
vector<int> cl[100005];
void dfs(int x) {
    d[x]=d[fa[x]]+1;
    for(int i;i<=n;i++
	) {
        dfs(y);
    }
}
int LAC(int x,int y) {
    if(d[x]<d[y]) {
        swap(x,y);
    }
    while(d[x]>d[y]) {
        x=fa[x];
    }
    while(x!=y) {
        x=fa[x];
        y=fa[y];
    }
    return x;
}
int main() {
    cin>>n;
    for(int i=1,x,y;i<n;i++) {
        cin>>x>>y;
        cl[x].push_back(y);
        fa[y]=x;
    }
    dfs(1);
    cin>>m;
    while(m--) {
        int u,v;
        cin>>u>>v;
        cout<<LAC(u,v)<<"\n";
    }
    return 0;
}