#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#include <cmath>
using namespace std;

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

vector<int> eul, lev;
int first[100005];
int rmq[20][200010];
vector<int> g[100005];
int n, m;
int logg[200010];

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

void dfs(int x, int level) {
    eul.push_back(x);
    lev.push_back(level);
    first[x] = eul.size()-1;
    for(auto next: g[x]) {
        dfs(next, level+1);
        eul.push_back(x);
        lev.push_back(level);
    }
}

void RMQ() {
    int k = eul.size();
    for(int i = 0; i <= k; i++)
        rmq[0][i] = i;
    for(int i = 2; i <= k; i++)
        logg[i] = 1+logg[i/2];
    for(int i = 1; (1<<i) <= k; i++)
        for(int j = 0; j+(1<<i)-1 < k; j++) {
            rmq[i][j] = rmq[i-1][j];
            if(lev[rmq[i-1][j+(1<<(i-1))]] < lev[rmq[i][j]])
                rmq[i][j] = rmq[i-1][j+(1<<(i-1))];
        }
}

int lca(int x, int y) {
    int a = first[x];
    int b = first[y];
    if(a > b) swap(a, b);
    int dif = b-a+1;
    int lg = logg[dif];
    int res = rmq[lg][a];
    if(lev[rmq[lg][a+dif-(1<<lg)]] > lev[res])
        res = rmq[lg][a+dif-(1<<lg)];
    return eul[res];
}

int main() {
    citire();
    dfs(1, 0);
    RMQ();
    int a, b;
    while(m--) {
        fin >> a >> b;
        fout << lca(a, b) << '\n';
    }
}