#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")

using namespace std;

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

const int DIM = 100005;

int lg2[DIM], rmq[2*DIM][20];
vector <int> v[DIM];
int n, tata, ii;
int q, x, y, lft, rgt, len;

int k, euler[DIM*2], level[DIM*2], poz[DIM];
void dfs(int nod, int lvl){
    euler[++k] = nod;
    level[k] = lvl;
    poz[nod] = k;
    for(int i=0; i<v[nod].size(); i++){
        dfs(v[nod][i], lvl+1);
        euler[++k] = nod;
        level[k] = lvl;
    }
}

int main(){
    fin>>n>>q;
    for(int i=2; i<=n; i++){
        fin>>tata;
        v[tata].push_back(i);
    }

    dfs(1, 1);

    lg2[1]=0;
    for(int i=2; i<=k; i++)
        lg2[i] = lg2[i>>1] + 1;

    for(int i=1; i<=k; i++)
        rmq[i][0] = i;

    for(int j=1; j<=lg2[k]; j++)
        for(int i=1; i<=k; i++){
            rmq[i][j] = rmq[i][j-1];

            ii = i + (1<<(j-1));
            if(ii <= k && level[ rmq[i][j] ] > level[ rmq[ii][j-1] ])
                rmq[i][j] = rmq[ii][j-1];
        }

    while(q--){
        fin>>x>>y;
        lft = min(poz[x], poz[y]);
        rgt = max(poz[x], poz[y]);
        len = lg2[rgt-lft+1];

        x = rmq[lft][len];
        y = rmq[rgt-(1<<len)+1][len];

        if(level[x] < level[y])
            fout<<euler[x];
        else
            fout<<euler[y];
        fout<<"\n";
    }
    return 0;
}