///dp[i][j]->al 2^j stramos al lui i

#include <fstream>
#include <math.h>
#include <vector>

using namespace std;

ifstream cin ("lca.in");
ofstream cout ("lca.out");

const int N = 1e5;
int h[N + 1], dp[N + 1][31], lg[N + 1];

vector <int> g[N + 1];

int n, m, x, y;

void dfs (int node, int parent)
{
    for (auto it : g[node])
        if (it != parent)
            h[it] = h[node] + 1, dfs (it, node);
}

int lca (int x, int y)
{
    if (h[x] < h[y])
        swap(x, y);
    ///aducerea la aceeasi inaltime
    for (int i = lg[h[x]]; i >= 0; --i)
        if (h[x] - (1 << i) >= h[y])
            x = dp[x][i];
    if (x == y)
        return x;
    ///cautarea lca
    for (int i = lg[h[x]]; i >= 0; --i)
        if (dp[x][i] != dp[y][i])
        {
            x = dp[x][i];
            y = dp[y][i];
        }
    return dp[x][0];
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i < n && cin >> dp[i + 1][0]; ++i)
        g[dp[i + 1][0]].push_back(i + 1);
    for (int i = 2; i <= n; ++i)
        lg[i] = lg[i >> 1] + 1;
    for (int i = 1; i <= lg[n]; ++i)
        for (int j = 1; j <= n; ++j)
            dp[j][i] = dp[dp[j][i - 1]][i - 1];
    dfs(1, 0);
    for (int i = 1; i <= m && cin >> x >> y; ++i)
        cout << lca (x, y) << '\n';
    return 0;
}