#include <bits/stdc++.h>

using namespace std;

#define MAXN 100005

int Parent[MAXN], Lead[MAXN], Viz[MAXN];

vector<int> G[MAXN];
vector<pair<int, int>> Queries[MAXN];

int Sol[2000005];

int Find(int i) {
    if(!Lead[i]) return i;
    return Lead[i] = Find(Lead[i]);
}
void Union(int a, int b) {
    Lead[Find(a)] = Find(b);
}

void dfs(int node) {

    for(auto vec : G[node]) {
        dfs(vec);
        Union(node, vec);
        Parent[Find(node)] = node;
    }

    Viz[node] = 1;

    for(auto q : Queries[node]) {
        if(Viz[q.first])
            Sol[q.second] = Parent[Find(q.first)];
    }
}

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

    int n, m, a, b;
    fin>>n>>m;

    for(int i=2; i<=n; i++) {
        fin>>a;
        G[a].push_back(i);
    }

    for(int i=1; i<=m; i++) {
        fin>>a>>b;
        Queries[a].push_back({b, i});
        Queries[b].push_back({a, i});
    }

    dfs(1);

    for(int i=1; i<=m; i++) {
        fout<<Sol[i]<<'\n';
    }

    return 0;
}