#include <bits/stdc++.h>

using namespace std;

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

int n, m, t[20][100005], lev[100005];
vector <int> Muchii[100005];

void dfs(int nod, int l)
{
    lev[nod] = l;
    for (auto it : Muchii[nod])
        dfs(it, l + 1);
}

int lca(int x, int y)
{
    if (lev[x] < lev[y]) swap(x, y);
    if (lev[x] != lev[y])
    {
        for (int i = 17; i >= 0; --i)
            if (lev[x] - (1 << i) >= lev[y])
                x = t[i][x];
    }
    if (x == y) return x;
    for (int i = 17; i >= 0; --i)
    {
        if (t[i][x] != 0 && t[i][y] != 0 && t[i][x] != t[i][y])
        {
            x = t[i][x];
            y = t[i][y];
        }
    }
    return t[0][x];
}

int main()
{
    fin >> n >> m;
    for (int i = 2; i <= n; ++i)
    {
        fin >> t[0][i];
        Muchii[t[0][i]].push_back(i);
    }
    dfs(1, 0);
    for (int k = 1; (1 << k) <= n; ++k)
        for (int i = 1; i <= n; ++i)
            t[k][i] = t[k - 1][t[k - 1][i]];
    while (m--)
    {
        int x, y;
        fin >> x >> y;
        fout << lca(x, y) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}