#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

const int NMax = 1e5, LgMax = 17;

vector <int> g[NMax + 5];
int n, m;
int ancestor[LgMax + 5][NMax + 5], level[NMax + 5], log2[NMax + 5];

void Read(){
    fin >> n >> m;
    for (int i = 2; i <= n; i++){
        fin >> ancestor[0][i];
        g[ancestor[0][i]].push_back(i);
    }
}

void Precalculate(){
    for (int i = 2; i <= n; i++)
        log2[i] = log2[i / 2] + 1;
    for (int log = 1; log <= log2[n]; log++)
        for (int i = 1; i <= n; i++)
            ancestor[log][i] = ancestor[log - 1][ancestor[log - 1][i]];
}

void CalculateLevels(int node){
    level[node] = level[ancestor[0][node]] + 1;
    for (auto son : g[node])
        CalculateLevels(son);
}

int LCA(int node1, int node2){
    if (level[node1] > level[node2])
        swap(node1, node2);
    int difference = level[node2] - level[node1];
    for (int i = log2[difference]; i >= 0; i--)
        if (difference & (1 << i))
            node2 = ancestor[i][node2];
    if (node1 == node2)
        return node1;
    int lvl = level[node1];
    for (int i = log2[lvl]; i >= 0; i--)
        if (ancestor[i][node1] != ancestor[i][node2]){
            node1 = ancestor[i][node1];
            node2 = ancestor[i][node2];
        }
    return ancestor[0][node1];
}

int main(){
    Read();
    Precalculate();
    CalculateLevels(1);
    while (m--){
        int x, y;
        fin >> x >> y;
        fout << LCA(x, y) << '\n';
    }
    return 0;
}