#include <fstream>
#include <vector>
#define NMAX 100005
using namespace std;
ifstream  fin("lca.in");
ofstream fout("lca.out");
int n,m,tata[NMAX],nivel[NMAX],A[18][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)
{
    for(int i=0; i<tree[nod].size(); i++)
    {
        int next_nod=tree[nod][i];
        nivel[next_nod]=nivel[nod]+1;
        DFS(next_nod);
    }
}

int lift(int x, int k)
{
    for(int i=0; i<=17; i++)
    {
        if(k&(1<<i))
        {
            x=A[i][x];
        }
    }

    return x;
}

int lca(int x,int y)
{
    int p1,p2,pmijl,ans;
    p1=0;
    p2=min(nivel[x],nivel[y]);
    ans=1;

    while(p1<=p2)
    {
        pmijl=(p1+p2)/2;

        int ax=lift(x,nivel[x]-pmijl);
        int ay=lift(y,nivel[y]-pmijl);

        if(ax==ay)
        {
            ans=ax;
            p1=pmijl+1;
        }
        else
        {
            p2=pmijl-1;
        }
    }

    return ans;
}

int main()
{
    citire();

    DFS(1);

    for(int i=1; i<=n; i++)
    {
        A[0][i]=tata[i];
    }

    for(int i=1; i<=17; i++)
    {
        for(int j=1; j<=n; j++)
        {
            A[i][j] = A[i-1][A[i-1][j]];
        }
    }

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

    return 0;
}