#include <bits/stdc++.h>
#define Nmax 100005
using namespace std;

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

int N, Q, L, K;
int le[Nmax], ri[Nmax], anc[Nmax][20];
vector<int> G[Nmax];

void DFS(int node, int father) {
    le[node] = ++K;
    anc[node][0] = father;
    for (int i = 1; i <= L; ++i)
        anc[node][i] = anc[anc[node][i - 1]][i - 1];

    for (auto it: G[node])
        if (it != father) DFS(it, node);
    ri[node] = ++K;
}
bool isAnc(int x, int y) {
    return (le[x] <= le[y] && ri[y] <= ri[x]);
}
int lca(int x, int y) {
    if (isAnc(x, y)) return x;
    if (isAnc(y, x)) return y;
    for (int i = L; i >= 0; --i)
        if (!isAnc(anc[x][i], y)) x = anc[x][i];
    return anc[x][0];
}
int main()
{
    fin >> N >> Q;
    L = ceil(log2(N));
    for (int i = 2; i <= N; ++i) {
        int x;
        fin >> x;
        G[x].push_back(i);
    }
    DFS(1, 1);

    while (Q--) {
        int x, y;
        fin >> x >> y;
        fout << lca(x, y) << '\n';
    }

    return 0;
}