#include <bits/stdc++.h>
#define for0(i, n) for(int i = 0; i < n; i++)
#define for1(i, n) for(int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
#ifdef _WIN32
#include <windows.h>
#define print(x) PRINT(x, #x)
template<typename T> inline const void PRINT(T VARIABLE, string NAME)
{
#ifndef ONLINE_JUDGE /// ONLINE_JUDGE IS DEFINED ON CODEFORCES
    HANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);
    SetConsoleTextAttribute(hConsole, 10);
    cerr << NAME << " = " << VARIABLE;
    SetConsoleTextAttribute(hConsole, 7);
    cerr << '\n';
#endif
}
#else
#define print(x) 0
#endif
typedef long long ll;
typedef unsigned long long ull;
const ll INFLL = 2 * (ll)1e18 + 100;
const int INFINT = 2 * (int)1e9 + 100;
const double PI = atan(1) * 4;
const double EPS = 1e-12;
const int SEED = 1e3 + 7;

const int MOD = 998244353; /// careful here (7 or 9, 66.. etc)
const int NMAX = 1e5 + 5;

ifstream fin("lca.in");
ofstream fout("lca.out");
#define cin fin
#define cout fout


int n, q;
V tree[NMAX];
int depth[NMAX], parent[20][NMAX];


void dfs(int nod, int p, int d)
{
    parent[0][nod] = p;
    depth[nod] = d;
    for(auto i: tree[nod]) if(i != p) dfs(i, nod, d + 1);
}

int lca(int a, int b)
{
    if(depth[a] < depth[b]) swap(a, b);

    for(int i = 19; i >= 0; i--)
        if(depth[a] - (1 << i) >= depth[b])
            a = parent[i][a];

    if(a == b) return a;

    for(int i = 19; i >= 0; i--)
        if(parent[i][a] != parent[i][b])
        {
            a = parent[i][a];
            b = parent[i][b];
        }

    return parent[0][a];
}


int main()
{
    FASTIO;
    cin >> n >> q;
    for1(i, n - 1)
    {
        int a;
        cin >> a;
        tree[i + 1].pb(a);
        tree[a].pb(i + 1);
    }

    for0(i, 20) for0(j, NMAX) parent[i][j] = -1;
    dfs(1, -1, 0);

    for(int lvl = 0; lvl < 20; lvl++) for1(i, n)
    {
        if(parent[lvl][i] != -1) parent[lvl + 1][i] = parent[lvl][parent[lvl][i]];
    }

    while(q--)
    {
        int a, b;
        cin >> a >> b;
        int temp = lca(a, b);
        cout << temp << '\n';
    }

    return 0;
}