using namespace std;
#include<iostream>
#include<fstream>
#include<vector>

#define NMAX 100005

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

int n, Q;
vector<int> G[NMAX];
int level[NMAX];
int euler[NMAX], k;
int fst[NMAX];
int p2[NMAX];
int rmq[20][NMAX];

void dfs(int nod, int nivel) {
    euler[++k] = nod;
    level[k] = nivel;
    fst[nod] = k;
    
    for (auto it: G[nod]) {
        dfs(it, nivel+1);
        euler[++k] = nod;
        level[k] = nivel;
    }
}

int lca(int x, int y) {
    
    int a = fst[x], b = fst[y];
    if (a > b) swap(a, b);
    
    int l = b-a+1;
    int sol = rmq[p2[l]][a];
    if (level[rmq[p2[l]][a]] > level[rmq[p2[l]][b - (1<<p2[l]) + 1]]) {
        sol = rmq[p2[l]][b - (1<<p2[l]) + 1];
    }
    return euler[sol];
}

int main() {
    
    fin >> n >> Q;
    for (int i = 2; i<=n; i++) {
        int a; fin >> a;
        G[a].push_back(i);
    }
    
    dfs(1, 0);
    
    for (int i = 2; i<=k; i++) {
        p2[i] = p2[i/2]+1;
    }
    for (int i = 1; i<=k; i++) {
        rmq[0][i] = i;
    }
    
    for (int i = 1; (1<<i)<k; i++) {
        for (int j = 1; j<=k-(1<<i); j++) {
            rmq[i][j] = rmq[i-1][j];
            
            if (level[rmq[i-1][j+(1<<(i-1))]] < level[rmq[i][j]]) {
                rmq[i][j] = rmq[i-1][j+(1<<(i-1))];
            }            
        }
    }
    
    for (int i = 1; i<=Q; i++) {
        int a, b;
        fin >> a >> b;
        fout << lca(a, b) << "\n";
    }
    
    return 0;
}