#include <fstream>
#include <vector>

using namespace std;

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

int n, m, i, t[100003], a, b, niv[100003], nr[100003], last, last2;
vector<int> v[100003];
char s[20];

void dfs(int nod, int nivel){
    if(nivel == 80001 && last2 == 0){
        last2 = nod;
        return;
    }
    if(nivel == 40001 && last == 0){
        last = nod;
        return;
    }
    niv[nod] = nivel;
    if(nr[nod] > 0)
        for(int i = 0;i<v[nod].size();i++){
            int val = v[nod][i];
            dfs(val, nivel+1);
        }
}

int main(){
    fin>>n>>m;
    for(i=2;i<=n;i++){
        fin>>t[i];
        v[t[i]].push_back(i);
        nr[t[i]]++;
    }
    dfs(1, 1);
    if(last != 0)
        dfs(last, 40001);
    if(last != 0)
        dfs(last2, 80001);
    while(m--){
        a = b = 0;
        fin.get();
        fin>>s;
        for(i=0;s[i]!=0;i++)
            a = a*10 + s[i] - '0';
        fin>>s;
        for(i=0;s[i]!=0;i++)
            b = b*10 + s[i] - '0';
        while(niv[a] > niv[b])
            a = t[a];
        while(niv[b] > niv[a])
            b = t[b];
        while(a != b){
            a = t[a];
            b = t[b];
        }
        fout<<a<<"\n";
    }

    return 0;
}