#include<cstdio>
#include<vector>
#define pb(x) push_back(x)

using namespace std;

const int nmax=1e5+5;

vector<int>g[nmax];
int euler[nmax<<1],h[nmax<<1],log2[nmax<<1],tope,first[nmax],rmq[20][nmax<<2];

inline void dfs(int node,int hei)
{
    euler[++tope]=node;
    h[tope]=hei;
    first[node]=tope;
    int i;
    for(i=0;i<g[node].size();++i)
    {
        dfs(g[node][i],hei+1);
        euler[++tope]=node;
        h[tope]=hei;
    }
}

inline void rmqu()
{
    int i,j,l,k;
    log2[1]=0;
    for(i=2;i<=tope;++i)
        log2[i]=1+log2[i>>1];
    for(i=1;i<=tope;++i)
        rmq[0][i]=i;
    for(i=1 ; (1<<i) < tope ; ++i)
        for(j=1 ; j + (1<<i) <= tope ; ++j)
        {
            l=1<<(i-1);
            rmq[i][j]=rmq[i-1][j];
            if(h[rmq[i-1][j+l]] < h[rmq[i][j]])
                rmq[i][j]=rmq[i-1][j+l];
        }
}

inline int lca(int x,int y)
{
    int dif,l,sol,add;
    int a=first[x],b=first[y];
    if(a>b)
    {
        a^=b;
        b=a^b;
        a^=b;
    }
    dif=b-a+1;
    l=log2[dif];
    sol=rmq[l][a];
    add=dif - (1<<l);
    if(h[sol]>h[rmq[l][a+add]])
        sol=rmq[l][a+add];
    return euler[sol];
}

int main()
{
    freopen("lca.in","r",stdin);
    freopen("lca.out","w",stdout);
    int q,n,i,j;
    scanf("%d%d",&n,&q);
    int x;
    for(i=2;i<=n;++i)
    {
        scanf("%d",&x);
        g[x].pb(i);
    }
    dfs(1,0);
    rmqu();
    while(q--)
    {
        scanf("%d%d",&i,&j);
        printf("%d\n",lca(i,j));
    }
}