#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;

ifstream fin("lca.in");
ofstream fout("lca.out");

const int nmax=100001;
int Euler[2*nmax],Level[2*nmax],H[nmax],n,m,k=1,M[2*nmax][19],x,y,Log[2*nmax];
vector<int> Graf[nmax];

void ST()
{
    k--;
    for(int i=1;i<=k;++i)
        M[i][0]=i;


    for(int j=1; j << 1 <k;++j)
        for(int i=1;i+(1<<j)<=k;++i)
    {
        x=M[i][j-1];
        y=M[i+(1<<(j-1))][j-1];
        if(Level[x]<Level[y])
            M[i][j]=x;
        else M[i][j]=y;
    }

}
void parcurgere(int nodCurent,int level)
{
    Level[k]=level;
    Euler[k]=nodCurent;
    if(H[nodCurent]==0)
        H[nodCurent]=k;
    k++;
    for(int i=0;i<Graf[nodCurent].size();++i)
    {
        parcurgere(Graf[nodCurent][i],level+1);
        Level[k]=level;
        Euler[k]=nodCurent;
        k++;
    }

}

int RMQ(int x,int y)
{
    int st,dr;
    st=H[x];
    dr=H[y];
    if(st>dr)
        swap(st,dr);
    int k=Log[dr-st+1];
    x=M[st][k];
    y=M[dr-(1<<k)+1][k];
    if(Level[x]<Level[y])
        return Euler[x];
    else return Euler[y];
}

int main()
{

    fin>>n>>m;
    for(int i=2;i<=n;++i)
    {
        fin>>x;
        Graf[x].push_back(i);
    }
    parcurgere(1,0);
    ST();

    for(int i=2;i<=k;++i)
        Log[i]=Log[i/2]+1;
    for(int i=1;i<=m;++i)
    {
        fin>>x>>y;
        fout<<RMQ(x,y)<<"\n";
    }

    return 0;
}