#include<cstdio>
#include<algorithm>
#include<cmath>
#define N 300005
using namespace std;
int end[N],go[N*2],next[N*2],value[N*2];
int q[N],deep[N],f[N][20],ans[N][20],x,y,n,Q,cnt,i,j;
void add(int u,int v){go[++cnt]=v;next[cnt]=end[u];end[u]=cnt;}
int LCA(int x,int y)
{
    if (deep[x]<deep[y]) swap(x,y);
    int d=deep[x]-deep[y];
    for (int i=0;i<=19;i++)
        if ((d>>i)&1)
            x=f[x][i];
    if (x==y) return x;
    for (int i=19;i>=0;i--)
        if (f[x][i]!=f[y][i])
            x=f[x][i],y=f[y][i];
    return f[x][0];
}
void bfs()
{
    int h=0,t=1;q[1]=1;deep[1]=0;f[1][0]=0;
    while (h<t)
    {
        int k=q[++h];
        for (int i=end[k];i;i=next[i])
            if (go[i]!=f[k][0])
                q[++t]=go[i],f[go[i]][0]=k,deep[go[i]]=deep[k]+1;
  }
}
int GET(int x,int y)
{
    int d=(int)log2(y-x+1);
    return LCA(ans[x][d],ans[y-(1<<d)+1][d]);
}
int main()
{
    while (scanf("%d",&n)!=EOF)
    {
        for (i=1;i<=n;i++) end[i]=0;cnt=0;
        for (i=1;i<n;i++)
            scanf("%d%d",&x,&y),add(x,y),add(y,x);bfs();
        for (j=1;j<=19;j++)
            for (i=1;i<=n;i++)
                f[i][j]=f[f[i][j-1]][j-1];
        for (i=1;i<=n;i++) ans[i][0]=i;
        for (j=1;j<=19;j++)
            for (i=1;i+(1<<(j-1))<=n;i++)
                ans[i][j]=LCA(ans[i][j-1],ans[i+(1<<(j-1))][j-1]);
        scanf("%d",&Q);
        while (Q--)
        {
            scanf("%d%d",&x,&y);
            printf("%d\n",GET(x,y));
      }
  }
}