#include <fstream>
#include <vector>
#define DIM 100001
using namespace std;
vector<int> L[DIM];
int T[DIM], Niv[DIM], i, x, y;
int n, m;
void dfs(int nod, int niv) {
    Niv[nod] = niv;
    for (int i=0;i<L[nod].size();i++) {
        int fiu = L[nod][i];
        dfs(fiu, niv+1);
    }
}

int main () {
    ifstream fin ("lca.in");
    ofstream fout("lca.out");
    fin>>n>>m;
    for (i=2;i<=n;i++) {
        fin>>T[i];
        L[ T[i] ].push_back(i); /// liste de fii
    }

    dfs(1, 1);
    /// T = vector de tati
    /// Niv = vector cu nivelul fiecarui nod

    while (m--) {
        fin>>x>>y;
        while (Niv[x] != Niv[y]) {
            if (Niv[x] > Niv[y])
                x = T[x];
            else
                y = T[y];
        }
        while (x!=y) {
            x = T[x];
            y = T[y];
        }
        fout<<x<<"\n";
    }

    return 0;
}