# include <fstream>
# include <vector>
# include <algorithm>
# define a first.first
# define b first.second
# define c second
# define DIM 100010
# define INF 2000000000
using namespace std;
ifstream fin("lca.in");
ofstream fout("lca.out");
vector <int> Lista[DIM];
pair<pair<int,int>,int> sol[3];
int d[20][DIM],niv[DIM],tata[DIM],lg[DIM],p[20];
int n,m,i,j,t,x,y,l,step;
void dfs(int nc,int nivc){
    niv[nc]=nivc;
    for(int i=0;i<Lista[nc].size();i++){
        int nv=Lista[nc][i];
        if(!niv[nv])
            dfs(nv,nivc+1);
    }
}
int main () {
    fin>>n>>m;
    for(step=1;step<=n;step<<=1)
        p[i++]=step;
    for(step=2;step<=n;step++)
        lg[step]=lg[step/2]+1;
    for(i=2;i<=n;i++){
        fin>>x;
        Lista[x].push_back(i);
        tata[i]=x;
    }
    dfs(1,1);
    for(i=1;i<=n;i++)
        d[0][i]=tata[i];
    for(i=1;i<=18;i++)
        for(j=1;j<=n;j++)
            d[i][j]=d[i-1][d[i-1][j]];
    for(i=1;i<=m;i++){
        fin>>x>>y;
        if(niv[x]<niv[y])
            swap(x,y);
        l=niv[x]-niv[y];
        step=p[lg[l]];
        for(j=x;step;step>>=1)
            if(niv[j]-step>=niv[y])
                j=d[lg[step]][j];
        step=p[lg[niv[j]]];
        if(j!=y){
            for(t=y;step;step>>=1)
                if(niv[j]-step>=1&&d[lg[step]][j]!=d[lg[step]][t]){
                    j=d[lg[step]][j];
                    t=d[lg[step]][t];
                }
            fout<<tata[j]<<"\n";
        }
        else
            fout<<j<<"\n";
    }
    return 0;
}