#include <bits/stdc++.h>
#define pii pair<int, int>
#define ff first
#define ss second
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define FORR(i, a, b) for(int i = a; i >= b; --i)

//#define int long long
using namespace std;
const string TASK("lca");
ifstream fin(TASK + ".in");
ofstream fout(TASK + ".out");
#define cin fin
#define cout fout

const int N = 1e5 + 9;

int n, q;
vvi G(N);

int w[N], t[N], dep[N], heavy_son[N], head[N], pos[N], vec[N], idx;
void Dfs(int x, int p)
{
    w[x] = 1;
    t[x] = p;
    dep[x] = dep[p] + 1;

    heavy_son[x] = -1;
    for(auto y : G[x])
    {
        if(y == p)continue;

        Dfs(y, x);

        w[x] += w[y];
        if(heavy_son[x] == -1 || w[y] > w[heavy_son[x]])
            heavy_son[x] = y;
    }
}
void Decomp(int x, int hd)
{
    vec[++ idx] = x;
    pos[x] = idx;
    head[x] = hd;

    if(heavy_son[x] != -1)Decomp(heavy_son[x], hd);

    for(auto y : G[x])
        if(y != t[x] && y != heavy_son[x])
            Decomp(y, y);
}

int get_lca(int x, int y)
{
    for(; head[x] != head[y]; x = t[head[x]])
        if(dep[head[x]] < dep[head[y]])
            swap(x, y);

    if(dep[x] > dep[y])swap(x, y);
    return x;
}

int main()
{
    cin >> n >> q;

    int x, y;
    FOR(i, 2, n)
    {
        cin >> x;
        G[i].pb(x);
        G[x].pb(i);
    }

    Dfs(1, 0);
    Decomp(1, 1);

    FOR(i, 1, q)
    {
        cin >> x >> y;
        cout << get_lca(x, y) << '\n';
    }
    return 0;
}