#include <fstream>
#include <vector>
#define NMax 100005
using namespace std;

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

vector <int> G[NMax];
int N,M;
int TT[NMax],Level[NMax];
void ReadTree()
{
    fin>>N>>M;
    for(int i=2;i<=N;i++)
        {
            fin>>TT[i];
            G[TT[i]].push_back(i);
        }
}

void DFS(int Node)
{
    for(int i=0;i<(int)G[Node].size();i++)
        {
            int Vecin = G[Node][i];
            Level[Vecin] = Level[Node] + 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()
{
    while(M--)
    {
        int x,y;
        fin>>x>>y;
        fout<<LCA(x,y)<<"\n";
    }
}

int main()
{
    ReadTree();
    DFS(1);
    SolveandPrint();
    return 0;
}