#include <fstream>
#include <cmath>

using namespace std;
const int NMAX = 100002;

int v[NMAX], dp[20][NMAX], h[NMAX];

ifstream cin("lca.in");
ofstream cout("lca.out");

void urcare(int a, int &b) ///b e mai jos si tre sa il urcam
{
    int k = h[b] - h[a], nod = b, i = 18;
   // cout << k << '\n';
    while(k > 0)
    {
        while(k < (1 << i))
            i--;
        nod = dp[i][nod];
        k -= (1 << i);
    }
    b = nod;
}

int stramosi(int a, int b)
{
    if(a == b)   ///caz particular in care coincid nodurile
        return a;
    int i = 18;
    while(i >= 0)
    {
        if(dp[i][a] == dp[i][b]) ///dc sunt tot la fel, coboram
            i--;
        else ///dc nu, ne inlocuim nodurile cu de-astea noi
        {
            a = dp[i][a];
            b = dp[i][b];
        }
    }
    return v[a];
}

int main()
{
    int n, m, a, b;
    cin >> n >> m;
    for(int i = 2; i <= n; i++)
    {
        cin >> v[i];
        dp[0][i] = v[i];
        h[i] = h[v[i]] + 1;
    }
    for(int i = 1; i <= 18; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            dp[i][j] = dp[i - 1][dp[i - 1][j]];
        }
    }
    while(m--)
    {
        cin >> a >> b;
        if(h[a] != h[b])
        {
            if(h[a] > h[b])
                swap(a, b);
            urcare(a, b);
            //cout << a << " " << b << '\n';
        }
        cout << stramosi(a, b) << '\n';
    }
    return 0;
}