#include <bits/stdc++.h>

using namespace std;

#define NN 100005
#define MAXL 50

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

int n, E[2 * NN], L[2 * NN], FATHER[NN], FIRST[NN], K, LG[MAXL], dp[NN][MAXL], m;

void dfs(int node, int level)
{
    E[++K] = node;
    L[K] = level;
    FIRST[node] = K;

    for (int i = 2; i <= n; ++i)
    {
        if (FATHER[i] == node)
        {
            dfs(i, level + 1);
            E[++K] = node;
            L[K] = level;
        }
    }
}

int precompute() {
    LG[2] = 1;
    for (int i = 3; i <= MAXL; ++i)
        LG[i] = LG[i >> 1] + 1;

    for (int i = 1; i <= K; ++i)
        dp[i][0] = i;

    for (int j = 1; j <= LG[K]; ++j)
        for (int i = 1; i + (1 << j) - 1 <= K; ++i)
            if (L[dp[i][j - 1]] < L[dp[i + (1 << (j - 1))][j - 1]])
                dp[i][j] = dp[i][j - 1];
            else
                dp[i][j] = dp[i + (1 << (j - 1))][j - 1];

}

int answerLCA(int x, int y){
    x = FIRST[x];
    y = FIRST[y];
    int diff = y - x + 1;
    if (L[dp[x][LG[diff]]] < L[dp[x + LG[diff]][LG[diff]]])
        return E[dp[x][LG[diff]]];
    return E[dp[x + LG[diff]][LG[diff]]];
}

int main()
{
    fin >> n >> m;

    for (int i = 2; i <= n; ++i)
            fin >> FATHER[i];

    dfs(1, 0);
    precompute();

    for (int i = 1, x, y; i <= m; ++i){
        fin >> x >> y;
        fout << answerLCA(x, y) << endl;
    }

    return 0;
}