#include <bits/stdc++.h>

using namespace std;

const int logmax = 17;
const int nmax = 1e5 + 10;

int n, m;
int L[nmax];
vector < int > g[nmax];

int f[nmax][logmax];

void dfs(int node, int level, int dad) {
    f[node][0] = dad;
    for (int lvl = 1; (1 << lvl) <= level; ++lvl)
        f[node][lvl] = f[f[node][lvl-1]][lvl-1];

    L[node] = level;
    for (auto &it: g[node])
        dfs(it, level + 1, node);
}

void kanc(int &node, int k) {
    for (int i = 0; (1 << i) <= k; ++i)
        if (k & (1 << i))
            node = f[node][i];
}

int get_anc(int x, int y) {
    if (L[x] > L[y]) swap(x, y);
    kanc(y, L[y] - L[x]);

    if (x == y) return x;

    for (int lvl = logmax - 1; lvl >= 0; --lvl)
        if (f[x][lvl] != f[y][lvl])
            x = f[x][lvl], y = f[y][lvl];

    return f[x][0];
}

int main()
{
    freopen("lca.in","r",stdin);
    freopen("lca.out","w",stdout);

    ios_base :: sync_with_stdio(false);

    cin >> n >> m;
    for (int i = 2; i <= n; ++i) {
        int x; cin >> x;
        g[x].push_back(i);
    }

    dfs(1, 1, 0);

    for (int i = 1; i <= m; ++i) {
        int x, y;
        cin >> x >> y;
        cout << get_anc(x, y) << '\n';
    }

    return 0;
}