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

const int nmax = 100000;
vector <int> v[nmax + 5];
int r[20][nmax+5];
int st[nmax + 5];
int dr[nmax + 5];
int n,q;
int o;

void dfs(int nod)
{
    st[nod]=++o;
    for(auto& i : v[nod])
        dfs(i);
    dr[nod]=++o;
}

bool is_anc(int anc,int ch)
{
    return st[anc]<=st[ch] && dr[ch]<=dr[anc];
}

int lca(int x,int y)
{
    if(is_anc(x,y)) return x;
    if(is_anc(y,x)) return y;
    for(int i=19;i>=0;i--)
        if(r[i][x]!=0 && !is_anc(r[i][x],y))
            x=r[i][x];
    return r[0][x];
}



int main()
{
    fin>>n>>q;
    for(int i=2;i<=n;i++){
        fin>>r[0][i];
        v[r[0][i]].push_back(i);
    }
    dfs(1);
    dr[0]=++o;
    for(int e = 1;(1<<e)<=n;e++)
        for(int i=1;i<=n;i++)
            r[e][i]=r[e-1][r[e-1][i]];
    for(int i=1;i<=q;i++)
    {
        int a,b;
        fin>>a>>b;
        fout<<lca(a,b)<<'\n';
    }

}