#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];
void read()
{
    in>>n>>m;
    for(int i=2;i<=n;++i)
    {
        in>>TT[i];
        G[TT[i]].push_back(i);

    }
}
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])
        x=TT[x];
    while(x!=y)
    {
        x=TT[x];
        y=TT[y];
    }
    out<<x<<endl;
}
int main()
{
    read();
    dfs(1,0);
    int l,k;
    for(int i=1;i<=m;i++)
    {
        in>>l>>k;
        lca(l,k);
    }
}