#include <fstream>
#include <vector>
using namespace std;

ifstream is("lca.in");
ofstream os("lca.out");

using VI = vector<int>;
using VVI = vector<VI>;

int n, m;
VI e, nv, poz, log2;
VVI g, r;

void Read();
void Dfs(int nod, int niv);
void RMQ();
void Query();

int main()
{
    Read();
    Dfs(1, 1);
    RMQ();
    Query();
    is.close();
    os.close();
    return 0;
}

void Read()
{
    is >> n >> m;
    g = VVI(n + 1);
    poz = VI(n + 1);
    e.push_back(0);
    nv.push_back(0);
    int nod;
    for ( int i = 2; i <= n; ++i )
    {
        is >> nod;
        g[nod].push_back(i);
    }
}

void Dfs(int nod, int niv)
{
    poz[nod] = e.size();
    e.push_back(nod);
    nv.push_back(niv);
    for ( const auto& nodv : g[nod] )
    {
        Dfs(nodv, niv + 1);
        e.push_back(nod);
        nv.push_back(niv);
    }
}

void RMQ()
{
    int N = 2 * n;
    r = VVI(N, VI(20));
    --N;
    for ( int i = 0; i <= N; ++i )
        r[i][0] = i;
    for ( int j = 1; ( 1 << j ) <= N; ++j )
        for ( int i = 1; i + ( 1 << j ) - 1 <= N; ++i )
            if ( nv[r[i][j - 1]] < nv[r[i + ( 1 << ( j - 1 ) )][j - 1]] )
                r[i][j] = r[i][j - 1];
            else
                r[i][j] = r[i + ( 1 << ( j - 1 ) )][j - 1];
}

void Query()
{
    log2 = VI(2 * n);
    for ( int i = 2; i < 2 * n; ++i )
        log2[i] = log2[i / 2] + 1;
    int x, y, val;
    while ( m-- )
    {
        is >> x >> y;
        x = poz[x];
        y = poz[y];
        if ( x > y )
            swap(x, y);
        val = log2[y - x + 1];
        if ( nv[r[x][val]] < nv[r[y - ( 1 << val ) + 1][val]] )
            os << e[r[x][val]] << "\n";
        else
            os << e[r[y - ( 1 << val ) + 1][val]] << "\n";
    }
}