#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("lca.in");
ofstream fout("lca.out");

const int Nmax=100005;
vector <int> G[Nmax];
int N,M,TT[Nmax],Level[Nmax];

void Read()
{
    fin>>N>>M;
    for(int i=2;i<=N;++i)
        {fin>>TT[i];
         //G[TT[i]].push_back(i);
        }
}

void DFS(int Nod)
{
    for(int i=1;i<=G[Nod].size();++i)
    {
        int Vecin=G[Nod][i];
        Level[Vecin]=Level[Nod]+1;
        DFS(Vecin);
    }
}

int LCA(int x,int y)
{
    if(Level[x]<Level[y]) swap(x,y);
    while(Level[x]!=Level[y]) x=TT[x];
    while(x!=y)
    {
        x=TT[x];
        y=TT[y];
    }
    return x;
}

void SolveandPrint()
{
    Read();
    DFS(1);
    while(M--)
    {
        int x,y;
        fin>>x>>y;
        fout<<LCA(x,y)<<"\n";
    }
}

int main()
{
    SolveandPrint();
    return 0;
}