// Template v2
#define pb push_back
#define mp make_pair
#define first x
#define second y
#define l(x) x<<1
#define r(x) x<<1 | 1
#define lsb(x) x & -x
#include<fstream>
#include<vector>
#include<iomanip>
#include<algorithm>
#include <bitset>
using namespace std;
  
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PKK;
// primes less than 100
const int PRIM[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
const int CMAX = 10005;
const int MOD = 1000000007;
const int NMAX = 100005;
const int LOGMAX = log2(100005)+3;
const short INF16 = 32000;
const int INF = 2*1e9 + 6661369;
const LL INF64 = LL(1e18);
const LD EPS = 1e-9, PI = acos(-1.0);
const int dx[]={-1,1,0,0};
const int dy[]={0,0,1,-1};
ifstream cin("lca.in");
ofstream cout("lca.out");

int dp[LOGMAX][NMAX], l[NMAX];
VI G[NMAX];

void dfs(int v, int d)
{
    l[v]=d;
    for(int i=0; i<G[v].size(); ++i)
        dfs(G[v][i], d+1);
}

int lca(int v, int w)
{
    if(l[v]<l[w])
        swap(v,w);

    for(int step=log2(l[v])+1; step>=0; --step)
        if(l[v]-(1<<step) >= l[w])
            v=dp[step][v];
    if(v==w)
        return v;
    for(int step=log2(l[w])+1; step>=0; --step)
        if(dp[step][v] && dp[step][v]!=dp[step][w])
            v=dp[step][v], w=dp[step][w];

    return dp[0][v];
}

int n,m,x,y;
void read()
{
    cin>>n>>m;
    for(int i=2; i<=n; ++i)
    {
        cin>>x;
        dp[0][i]=x;
        G[x].pb(i);
    }
    for(int step=1; (1<<step)<=n; ++step)
        for(int i=1; i<=n; ++i)
            dp[step][i]=dp[step-1][dp[step-1][i]];
    dfs(1, 0);

    for(int i=1; i<=m; ++i)
    {
        cin>>x>>y;
        cout<<lca(x,y)<<"\n";
    }

}
 
int main(){
    cout<<setprecision(4)<<fixed;
    read();
      
    return 0;
}