#include<stdio.h>
#define NMAX 100000
int lvl[NMAX + 5],stramos[20][NMAX + 5],tata[NMAX + 5];

int cauta (int &nod, int str) {
    int p;
    for(p = 0; (1 << p) <= str; p++);
    if(p) p--;

    for(; p >= 0; p--)
        if((1 << p) <= str) {
            str -= (1 << p);
            nod = stramos[p][nod];
        }
}

int solve (int i) {
    return lvl[i] ? lvl[i] : solve(tata[i]) + 1;
}

int getLCA (int x, int y) {

    if(lvl[x] < lvl[y])
        cauta(y, lvl[y] - lvl[y]);
    if(lvl[y] < lvl[x])
        cauta(x, lvl[x] - lvl[y]);

    if(x == y)
        return x;
    if(tata[x] == tata[y])
        return tata[x];

    int p;
    for(p = 1; stramos[p][x] != stramos[p][y]; p++);

    for(; p >= 0; p--)
        if(stramos[p][x] != stramos[p][y])
            x = stramos[p][x],
            y = stramos[p][y];
    return tata[x];
}

int main() {
    freopen("lca.in","r",stdin);
    freopen("lca.out","w",stdout);
    int j,n,x,y,i,q,m;
    scanf("%d%d",&n,&m);
    tata[1] = 1;
    for(i = 2; i <= n; i++) {
        scanf("%d",&tata[i]);
        stramos[0][i] = tata[i];
        }

    lvl[1] = 1;
    for(j = 1; (1<<j) <= n; j++)
        for(i = 1; i <= n; i++)
            stramos[j][i] = stramos[j - 1][stramos[j - 1][i]];

    for(i = 2; i <= n; i++)
        if(lvl[i] == 0)
            lvl[i] = solve(i);

    for(q = 1; q <= m; q++) {
        scanf("%d%d",&x,&y);
        printf("%d\n",getLCA(x,y));
        }
    return 0;
}