#include <bits/stdc++.h>

using namespace std;

#define MAX_N 100000

int n, m, t, L;
vector <int> tin, tout;
vector <vector <int> > graph, up;
bitset <MAX_N + 1> viz;

void dfs(int node, int parent)
{
    tin[node] = ++t;
    viz[node] = 1;

    up[node][0] = parent;
    for(int i = 1; i <= L ; i ++)
        up[node][i] = up[up[node][i - 1]][i - 1];

    for(int x : graph[node])
        if(!viz[x])
            dfs(x, node);
    tout[node] = ++t;
}

bool isAncestor (int a, int b)
{
    return (tin[a] <= tin[b]  &&  tout[b] <= tout[a]);
}

int lca(int a, int b)
{
    if(isAncestor(a, b))
        return a;
    if(isAncestor(b, a))
        return b;
    int u = a;
    for(int i = L; i >= 0; i --)
    {
        if(!isAncestor(up[u][i], b))
            u = up[u][i];
    }
    return up[u][0];
}

int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

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

    cin >> n >> m;
    graph.resize(n + 1);

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

    L = log2(n);

    up.resize(n + 1, vector <int> (L + 1));
    tin.resize(n + 1);
    tout.resize(n + 1);
    dfs(1, 1);

    for(int i = 1; i <= m; i ++)
    {
        int a, b;
        cin >> a >> b;
        cout << lca(a, b) << "\n";
    }
    return 0;
}