#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("lca.in");
ofstream g("lca.out");
#define N_MAX 100005
vector <int> G[N_MAX];
int n, m;
int eu[2 * N_MAX], first[2 * N_MAX], lv [2 * N_MAX], k, rmq[20][N_MAX * 4], lg[2 * N_MAX];
void euler(int nod, int lev)
{
    k++;
    eu[k] = nod;
    lv[k] = lev;
    first[nod] = k;
    for(auto it : G[nod])
    {
        euler(it, lev+1);
        k++;
        eu[k] = nod;
        lv[k] = lev;
    }

}

void rmq_build()
{
    for(int i = 2 ; i <= k ; i++)
        lg[i] = lg[i >> 1] + 1;
    for(int i = 1 ; i<= k ; i++)
        rmq[0][i] = i;

    for(int i = 1; (1 << i) < k; ++i)
        for(int j = 1; j <= k - (1 << i); ++j)
        {
            int l = 1 << (i - 1);

            rmq[i][j] = rmq[i-1][j];
            if(lv[rmq[i-1][j + l]] < lv[rmq[i][j]])
                rmq[i][j] = rmq[i-1][j + l];
        }
}

int lca(int x, int y)
{
//LCA-ul nodurilor x si y va fi nodul cu nivel minim din secventa (First[x], First[y]) din reprezentarea Euler a arborelui
    int diff, l, sol, sh;
    int a = first[x], b = first[y];
    if(a > b) swap(a, b);
    diff = b - a + 1;
    l = lg[diff];
    sol = rmq[l][a];
    sh = diff - (1 << l);
    if(lv[sol] > lv[rmq[l][a + sh]])
        sol = rmq[l][a + sh];
    return eu[sol];
}

int main()
{
    cout<<sizeof rmq/1024/1024;
    int x,y;
    f >> n >> m;
    for(int i = 2 ; i<= n ; i++)
    {
        f >> x;
        G[x].push_back(i);
    }
    euler(1, 0);
    rmq_build();
    for(int i = 1 ; i <= m ; i++)
    {
        f >> x >> y;
        cout<<lca(x, y)<<"\n";
    }
    for(int i=1;(1 << i) < k; i++)
    {
        for(int j = 1; j <= k - (1 << i); ++j)
            cout<<rmq[i][j]<<" ";
        cout<<"\n";
    }
    return 0;
}