#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <cmath>

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

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

const int NMAX=1e5+5;

vector<int>v[NMAX];

int lvl[NMAX];
int asc[20][NMAX];

void dfs(int p,int tata)
{
    int e;
    lvl[p]=lvl[tata]+1;
    for(e=1;e<=20;e++)
        asc[e][p]=asc[e-1][asc[e-1][p]];
    for(auto i:v[p])
    {
        if(tata!=i)
        {
            asc[0][i]=p;
            dfs(i,p);
        }
    }
}

int lca(int x,int y)
{
    int level,e;
    if(lvl[x]<lvl[y])
        swap(x,y);
    level=lvl[x]-lvl[y];
    for(e=20;e>=0;e--)
    {
        if(level & (1<<e))
            x=asc[e][x];
    }
    if(x==y)
        return x;
    for(e=20;e>=0;e--)
    {
        if(asc[e][x]!=asc[e][y])
        {
            x=asc[e][x];
            y=asc[e][y];
        }
    }
    return asc[0][x];
}

int main()
{
    int n,q,i,j;
    fin>>n>>q;
    for(i=2;i<=n;i++)
    {
        int x;
        fin>>x;
        v[i].push_back(x);
        v[x].push_back(i);
    }
    dfs(1,0);
    while(q--)
    {
        int x,y;
        fin>>x>>y;
        fout<<lca(x,y)<<"\n";
    }
    return 0;
}