#include <cstdio>
#include <vector>
#include <algorithm>
#define max(a, b) (a > b ? a : b)
#define NMAX 100005

using namespace std;

int n,m,k,t;
int lv[NMAX<<1],H[NMAX<<1],first[NMAX],lg[NMAX<<1];
vector<int>v[NMAX];
int rmq[30][NMAX<<2];

void dfs(int nod,int niv)
{
    lv[++k]=niv;
    H[k]=nod;
    first[nod]=k;
    for(int i = 0; i < v[nod].size(); ++i)
        {
            dfs(v[nod][i],niv+1);
            H[++k]=nod;
            lv[k]=niv;
        }
}

void citire()
{
   freopen("lca.in","r",stdin);
   scanf("%d%d",&n,&m);
   for(int i = 2; i <= n; ++i)
   {
       scanf("%d",&t);
       v[t].push_back(i);
   }
   dfs(1,0);
}

void Rmq()
{
    for(int i = 2; i <= n; ++i) lg[i] = lg[i/2] + 1;
    for(int i = 0; i <=k; ++i ) rmq[0][i] = i;
    for(int i = 1; (1<<i) <= k; ++i)
        for(int j = 1; j <= k - (1<<i)+1; ++j)
        {
          int l = 1<<(i-1);
          if(lv[rmq[i-1][j]] < lv[rmq[i-1][l + j]])  rmq[i][j] = rmq[i-1][j];
            else rmq[i][j] = rmq[i-1][j+l];
        }
}

int lca(int x, int y)
{
    int st = first[x];
    int dr = first[y];
    if (st > dr) swap(st,dr);
    int dif = (dr-st+1);
    int l = lg[dif];
    int sh = dif - (1<<l);
    if (lv[rmq[l][st]] < lv[rmq[l][st+sh]]) return H[rmq[l][st]];
        else return H[rmq[l][st+sh]];
}

void query()
{
    int x,y;
    freopen("lca.out","w",stdout);
    for(int i = 1; i <= m; ++i)
    {
        scanf("%d%d",&x,&y);
        printf("%d\n",lca(x,y));
    }
}

int main()
{
    citire();
    Rmq();
    query();
    return 0;
}