#include <vector>
#include <fstream>

using namespace std;

#define NMAX 100005
#define MAXL 20

int n, m, crt;
int Level[NMAX*2], Euler[NMAX*2];
int Lg[NMAX*2], Poz[NMAX];
int RMQ[MAXL][NMAX*4];

vector <int> tata[NMAX];

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

void citire()
{
    fin>>n>>m;

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

void parcurgere_euler(int nod, int lev)
{
    Euler[++crt] = nod; //adaugam nodul in reprezentarea Euler a arborelui
    Level[crt] = lev; //retinem nivelul fiecarei pozitii din reprezentarea Euler a arborelui
    Poz[nod] = crt; //retinem si prima aparitie a fiecarui nod in reprezentarea Euler a arborelui

    for(typeof tata[nod].begin() i = tata[nod].begin(); i != tata[nod].end(); ++i)
    {
        parcurgere_euler(*i, lev+1);

        Euler[++crt] = nod;
        Level[crt] = lev;
    }
}

void rmq()
{
    int i, j;

    for(i = 2; i <= crt; ++i)
        Lg[i] = Lg[i >> 1] + 1;
    for(i = 1; i <= crt; ++i)
        RMQ[0][i] = i;

    for(i = 1; (1 << i) < crt; ++i)
        for(j = 1; j <= crt - (1 << i); ++j)
        {
            RMQ[i][j] = RMQ[i-1][j];
            if(Level[RMQ[i-1][j + (1 << (i - 1))]] < Level[RMQ[i][j]])
                RMQ[i][j] = RMQ[i-1][j + (1 << (i - 1))];
        }
}

int lca(int x, int y)
{
    int len, sol;
    int a = Poz[x], b = Poz[y];

    if(a > b) { int aux = a; a = b ; b = aux; }

    len = Lg[b - a + 1];
    sol = RMQ[len][a];

    if(Level[sol] > Level[RMQ[len][b + 1 - (1 << len)]])
        sol = RMQ[len][b + 1 - (1 << len)];
    return Euler[sol];
}

int main()
{
    citire();
    parcurgere_euler(1, 0);
    rmq();

    for(int i = 1 ; i <= m ; i++)
    {
        int x, y;
        fin>>x>>y;
        fout<<lca(x, y)<<'\n';
    }

    fin.close();
    fout.close();

    return 0;
}