#include <cstdio>
#include <vector>
#include <utility>
#include <cstdlib>
#define MX 100001
#define minim(a,b) ((a<b) ? a : b)
using namespace std;
//varianta cu parsare

FILE *fin, *fout;

int n,m;
vector<int> c[MX];
vector<int> eul;
int niv[MX], ap[MX];
int nr1,nr2;

int r[6*MX],l;
char *buffer;
long lsize,poz;

int numar()
{
    int nr=0;
    while(buffer[poz]<'0' || buffer[poz]>'9') poz++;
    while(buffer[poz]>='0' && buffer[poz]<='9')
    {
        nr = nr*10 + buffer[poz] - '0';
        poz++;
    }
    return nr;
}

void citire()
{
    fseek(fin, 0, SEEK_END);
    lsize = ftell(fin);
    rewind(fin);

    buffer = (char*) malloc(lsize);
    fread(buffer, 1, lsize, fin);

    int i,x;
    n = numar();
    m = numar();
    for(i=2; i<=n; i++)
    {
        x = numar();
        c[x].push_back(i);
    }
}

void repr_euler(int p)
{
    vector<int>::iterator it;
    eul.push_back(p);

    if(ap[p] == 0)
    {
        ap[p] = eul.size()-1;
    }

    for(it=c[p].begin(); it!=c[p].end(); it++)
    {
        repr_euler(*it);
        eul.push_back(p);
    }
}

void nivel(int p)
{
    vector<int>::iterator it;
    for(it=c[p].begin(); it!=c[p].end(); it++)
    {
        niv[*it] = niv[p]+1;
        nivel(*it);
    }
}

inline int query(int nod, int left, int right)
{
    if(nr1<=left && right<=nr2)
    {
        return r[nod];
    }

    int mid = (left+right)>>1;
    int s,d;
    s=d=2000000;
    if(nr1 <= mid)
    {
        s = query(nod<<1, left, mid);
    }
    if(mid < nr2)
    {
        d = query((nod<<1)+1, mid+1, right);
    }

    return minim(s, d);
}

inline void adauga(int nod, int left, int right)
{
    if(left == right)
    {
        r[nod] = nr1;
        return;
    }
    int mid = (left+right)>>1;
    if(nr2 <= mid) adauga(nod<<1, left, mid);
    else adauga((nod<<1)+1, mid+1, right);

    if(niv[ r[nod<<1] ] < niv[ r[(nod<<1)+1] ]) r[nod] = r[nod<<1];
    else r[nod] = r[(nod<<1)+1];
}

int main()
{
    fin = fopen("lca.in", "r");
    fout = fopen("lca.out", "w");
    int x;

    citire();
    eul.push_back(0);
    repr_euler(1);
    nivel(1);

    int i;
    l = eul.size()-1;
    for(i=1; i<=l; i++)
    {
        nr1 = eul[i];
        nr2 = i;
        adauga(1, 1, l);
    }

    for(i=1; i<=m; i++)
    {
        nr1 = numar();
        nr2 = numar();
        if(ap[nr1] > ap[nr2]) swap(nr1, nr2);
        nr1 = ap[nr1];
        nr2 = ap[nr2];

        x = query(1, 1, l);
        fprintf(fout, "%d\n", x);
    }

    free(buffer);

    fclose(fin); fclose(fout);
    return 0;
}