//
// Created by Toma Ariciu
// Copyright Ⓒ 2021 Toma Ariciu. All rights reserved.
//

#include <iostream>
#include <fstream>
#include <vector>
#include <math.h>

using namespace std;

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

vector <int> G[100005];
int anc[20][100005], levels[100005];
int nr_noduri, nr_intervale;

void citire()
{
    fin>>nr_noduri>>nr_intervale;
    for(int i=2; i<=nr_noduri; i++)
    {
        fin>>anc[0][i];
        G[anc[0][i]].push_back(i);
    }
}

void init_anc()
{
    for(int i=1; (1<<i) <= nr_noduri; i++)
    {
        for(int j=1; j <= nr_noduri; j++)
        {
            anc[i][j]=anc[i-1][anc[i-1][j]];
        }
    }
}

void dfs(int n, int l)
{
    levels[n]=l;
    for(int i=0; i<G[n].size(); i++)
    {
        dfs(G[n][i], l+1);
    }
}

void solve()
{
    for(int test=1; test<=nr_intervale; test++)
    {
        int x,y;
        fin>>x>>y;
        if(levels[x]<levels[y])
            swap(x, y);
        int logx=log2(x), logy=log2(y);
        for(int k=logx; k >=0; k--)
            if(levels[x] - (1 << k) >= levels[y])
                x=anc[k][x];
        if(x==y)
        {
            fout<<x<<'\n';
            continue;
        }
        for(int k=logy; k>=0; k--)
        {
            if(anc[k][x] && anc[k][x]!=anc[k][y])
            {
                x=anc[k][x];
                y=anc[k][y];
            }
        }
        fout<<anc[0][x]<<'\n';
    }
}

int main()
{
    citire();
    init_anc();
    dfs(1, 0);
    solve();
    return 0;
}