#include <iostream>
#include <fstream>
#include <vector>
#define Nmax 100001
#define Lmax 21
using namespace std;

ifstream fin("lca.in");
ofstream fout("lca.out");
int n,m;
int log[Nmax],level[Nmax],F[Lmax][Nmax];
vector <int> G[Nmax];
void read()
{
    fin>>n>>m;
    int i;
    for(i=2;i<=n;i++)
    {
        fin>>F[0][i];
        G[F[0][i]].push_back(i);
    }

}
void DFS(int nod)
{
       for(unsigned int i=0;i<G[nod].size();i++)
       {
           level[G[nod][i]]=level[nod]+1;
           DFS(G[nod][i]);
       }


}
int LCA(int x,int y)
{
    if(level[x]>level[y])
        swap(x,y);
    while(level[x]!=level[y])
    {
        int k=log[level[y]-level[x]];
        y=F[k][y];
    }


    if (x==y)
        return x;

    for(int step=log[level[x]];step>=0;step--)
    {
    if (F[step][x]!=F[step][y])
    {
    x=F[step][x];
    y=F[step][y];
    }
    }
    return F[0][x];

}

void BuildLog()
{
    int i;
    for(i=2;i<=n;i++)
        log[i]=log[i/2]+1;
}



int main()
{
    read();

    DFS(1);

    BuildLog();

    int k,i;
    for(k=1;k<=log[n];k++)
        for(i=1;i<=n;i++)
            F[k][i]=F[k-1][F[k-1][i]];

    for(i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        fout<<LCA(x,y)<<"\n";
    }

    return 0;
}