#include<bits/stdc++.h>
using namespace std;
ifstream in("lca.in");
ofstream out("lca.out");
#define nrmax 100005
int v[nrmax];
vector<int>G[nrmax];
int n,m;
int TT[nrmax],level[nrmax];
int use[nrmax];
int logc[nrmax];
int A[100][nrmax];

void read()
{
    in>>n>>m;
    for(int i=2;i<=n;++i)
    {
        in>>A[0][i];
        G[A[0][i]].push_back(i);

    }
}
void acc()
{
    for(int i = 1 ; 1<<i <= n ; ++i)
    {
        for(int j = 1 ; j <= n ; ++j)
            A[i][j] = A[i-1][A[i-1][j]];
    }
    for(int i=2;i<=n;++i)
        logc[i]=logc[i/2]+1;
}
void dfs(int node,int lvl)
{
    use[node]=1;
    level[node]=lvl;
    for(int i=0;i<G[node].size();++i)
    {
        int vecin=G[node][i];
        if(!use[vecin])
            dfs(vecin,lvl+1);
    }
}

void lca(int x,int y)
{
    if(level[x]<level[y])
            swap(x,y);
    while(level[x]!=level[y]){
            int k=logc[level[x]-level[y]];
        x=A[k][x];
        }
        if(x==y) out<<x<<'\n';
        else{
    for(int i=logc[level[x]];i>=0;i--)
    {
        if((A[i][x]!=A[i][y]))
        {
            x=A[i][x];
            y=A[i][x];
        }
    }
    out<<A[0][x]<<'\n';
        }
}
int main()
 {
    read();
    acc();
    dfs(1,0);

    int l,k;
    for(int i=1;i<=m;i++)
    {
        in>>l>>k;
        lca(l,k);
    }
}