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

using namespace std;

const int MAXN = 100000;
const int LOG = 17;  

vector<int> tree[MAXN + 1];
int up[MAXN + 1][LOG + 1];  
int depth[MAXN + 1];


void dfs(int v, int parent) {
    up[v][0] = parent;
    for (int i = 1; i <= LOG; ++i) {
        up[v][i] = up[up[v][i - 1]][i - 1];
    }
    for (int u : tree[v]) {
        if (u != parent) {
            depth[u] = depth[v] + 1;
            dfs(u, v);
        }
    }
}

int lca(int u, int v) {
    if (depth[u] < depth[v]) {
        swap(u, v);
    }

    for (int i = LOG; i >= 0; --i) {
        if (depth[u] - (1 << i) >= depth[v]) {
            u = up[u][i];
        }
    }

    if (u == v) {
        return u;
    }

    for (int i = LOG; i >= 0; --i) {
        if (up[u][i] != up[v][i]) {
            u = up[u][i];
            v = up[v][i];
        }
    }
    return up[u][0];
}

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

    int n, m;
    fin >> n >> m;

    for (int i = 2; i <= n; ++i) {
        int parent;
        fin >> parent;
        tree[parent].push_back(i);
        tree[i].push_back(parent);
    }

    depth[1] = 0;
    dfs(1, 1);

    for (int i = 0; i < m; ++i) {
        int u, v;
        fin >> u >> v;
        fout << lca(u, v) << "\n";
    }

    return 0;
}