#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, m, o = 0, x, y, F[N], Dep[N], num[N], last[N], nxt[N];
int main() {
    queue<int> tot;
    tot.push(1);
    scanf("%d %d", &n, &m);
    for (int i = 2; i <= n; i++) scanf("%d", &F[i]), o++, nxt[o] = i, last[o] = num[F[i]], num[F[i]] = o;
    while (!tot.empty()) {
        x = tot.front();
        tot.pop();
        for (int i = num[x]; i; i = last[i]) Dep[nxt[i]] = Dep[x] + 1, tot.push(nxt[i]);
    }
    while (m--) {
        scanf("%d %d", &x, &y);
        while (x != y) {
            if (Dep[x] > Dep[y])
                x = F[x];
            else if (Dep[x] < Dep[y])
                y = F[y];
            else
                x = F[x], y = F[y];
        }
        printf("%d\n", x);
    }
}