#include <fstream>
#include <vector>
#define nmax (int)(1e5+1)
using namespace std;
ifstream cin("lca.in");
ofstream cout("lca.out");
int n,q,x,y,k,st[nmax],dr[nmax],rmq[18][nmax];
vector<int>v[nmax];
void dfs(int nod){
    st[nod]=++k;
    for(auto i:v[nod])
        dfs(i);
    dr[nod]=++k;
}
bool isParent(int x,int y){
    return st[x]<=st[y]&&dr[y]<=dr[x];
}
int lca(int x,int y){
    if(isParent(x,y))
        return x;
    if(isParent(y,x))
        return y;
    for(int i=17;i>=0;i--){
        int z=rmq[i][x];
        if(z!=0&&!isParent(z,y))
            x=z;
    }
    return rmq[0][x];
}
int main()
{
    cin>>n>>q;
    for(int i=2;i<=n;i++){
        cin>>x;
        rmq[0][i]=x;
        v[x].push_back(i);
    }
    dfs(1);
    dr[0]=++k;
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j<=n;j++)
            rmq[i][j]=rmq[i-1][rmq[i-1][j]];
    while(q--){
        cin>>x>>y;
        cout<<lca(x,y)<<'\n';
    }
    return 0;
}