#include <fstream>
#include <vector>
#include <cmath>
#define NMAX 100002
using namespace std;
ifstream  fin("lca.in");
ofstream fout("lca.out");
int H,n,m,tata[NMAX],nivel[NMAX],T2[NMAX];
vector<int> tree[NMAX];

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

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

void DFS(int nod, int tata, int t2)
{
    nivel[nod]=nivel[tata]+1;
    T2[nod]=t2;

    if(nivel[nod]%H==0)
    {
        t2=nod;
    }

    for(int i=0; i<tree[nod].size(); i++)
    {
        int next_nod=tree[nod][i];

        if(tata!=next_nod)
        {
            DFS(next_nod,nod,t2);
        }
    }
}

int LCA(int x, int y)
{
    while(T2[x]!=T2[y])
    {
        if(nivel[x]>nivel[y])
        {
            x=T2[x];
        }
        else
        {
            y=T2[y];
        }
    }

    while(x!=y)
    {
        if(nivel[x]>nivel[y])
        {
            x=tata[x];
        }
        else
        {
            y=tata[y];
        }
    }

    return x;
}
int main()
{
    citire();

    H=sqrt(n);
    DFS(1,0,0);

    int a,b;
    for(int i=1; i<=m; i++)
    {
        fin>>a>>b;
        fout<< LCA(a,b) << "\n";
    }

    return 0;
}