# include <cstdio>
# include <vector>
using namespace std;

FILE *f = freopen("lca.in", "r", stdin);
FILE *g = freopen("lca.out", "w", stdout);

const int N_MAX = 100001;
int n, m, nr;

int lg[2 * N_MAX];
int rmq[20][2 * N_MAX];
int P[2 * N_MAX];
int first[N_MAX];
int nivel[2 * N_MAX];

vector <int> G[N_MAX];

void read()
{
    scanf("%d %d", &n, &m);

    for (int i=1; i<n; i++)
    {
        int x;
        scanf("%d", &x);
        G[x].push_back(i+1);
    }
}

void Euler(int nod, int k)
{
    P[++nr] = nod;
    first[nod] = nr;
    nivel[nr] = k;

    for (int i : G[nod])
    {
        Euler(i, k+1);
        P[++nr] = nod;
        nivel[nr] = k;
    }
}

void init_rmq()
{
    for (int i=2; i<=nr; i++)
        lg[i]=  lg[i/2] + 1;

    for (int i = 1; i<=nr; i++)
        rmq[0][i] = i;        /// rmq reprezinta nodul din parc euleriana care are cel mai
                              /// mic nivel de la poz j la poz j + 2^i - 1;

    for (int i = 1; (1 << i) < nr; i++)
    {
        int put = (1 << (i-1));

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

            if (nivel[rmq[i-1][j]] > nivel[rmq[i-1][j + put]])
                rmq[i][j] = rmq[i-1][j + put];
        }
    }
}

int lca(int x, int y)
{
    if (first[x] > first[y]) swap(x, y);
    int dif = first[y] - first[x] + 1;
    int put = lg[dif];

    int sol = rmq[put][first[x]];

    if (nivel[rmq[put][first[x]]] > nivel[rmq[put][first[y] - (1<<put) + 1]])
        sol = rmq[put][first[y] - (1<<put) + 1];

    return P[sol];
}

void solve()
{
    for (int i=1; i<=m; i++)
    {
        int x, y;
        scanf("%d %d", &x, &y);
        printf("%d\n", lca(x, y));
    }
}

int main()
{
    read();
    Euler(1, 0);
    init_rmq();
    solve();
    return 0;
}