#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int NMAX = 100015;
vector <int> vec[NMAX];
int h[NMAX];
int poz[NMAX];
int top = 0;
int rmq[2 * NMAX][30];
int p2[30];
int nr2[NMAX];
void dfs(int u, int f) {
    h[u] = h[f] + 1;
    rmq[++top][0] = u;
    poz[u] = top;
    for(int v : vec[u]) {
        if(v != f) {
            rmq[++top][0] = u;
            poz[u] = top;
            dfs(v, u);
        }
    }
}

int main() {
    int n, m;
    freopen("lca.in", "r", stdin);
    freopen("lca.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(int i = 2; i <= n; i++) {
        int f;
        scanf("%d", &f);
        vec[i].push_back(f);
        vec[f].push_back(i);
    }
    dfs(1, 0);
    int put = 0, put2 = 1;
    for(int i = 1; i <= top; i++) {
        if(i >= put2 * 2) {
            put2 *= 2;
            put++;
        }
        nr2[i] = put2;
        p2[i] = put;
    }
    for(int l = 1, j = 1; l <= top; j++, l *= 2) {
        for(int i = 1; i <= top - l; i++) {
            if(h[rmq[i][j - 1]] < h[rmq[i + l][j - 1]]) {
                rmq[i][j] = rmq[i][j - 1];
            }
            else {
                rmq[i][j] = rmq[i + l][j - 1];
            }
        }
    }
    for(int i = 1; i <= m; i++) {
        int a, b;
        scanf("%d %d", &a, &b);
        int poza = min(poz[a], poz[b]);
        int pozb = max(poz[a], poz[b]);
        int dist = pozb - poza + 1;
        int n1 = h[rmq[poza][p2[dist]]];
        int n2 = h[rmq[pozb - nr2[dist] + 1][p2[dist]]];
        if(n1 < n2) {
            printf("%d\n", rmq[poza][p2[dist]]);
        }
        else {
            printf("%d\n", rmq[pozb - nr2[dist] + 1][p2[dist]]);
        }
    }
    return 0;
}