#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int a[1000000];
int m[1000000][18];
int dfs_size;

struct node {
	int value;
	struct node *next;
};

struct list {
	node *head;
};

list* create_list()
{
	list *l = (list*)calloc(1, sizeof(list));
	l->head = NULL;
	return l;
}

void insert_list(list* l, int value, int weight)
{
	if (l->head == NULL) {
		l->head = (node*)calloc(1, sizeof(node));
		l->head->value = value;
		return;
	}

	node *p = l->head;
	while (p->next != NULL)
		p = p->next;

	node *n = (node*)calloc(1, sizeof(node));
	n->value = value;
	p->next = n;
}

void destroy_list(list **l)
{
	while ((*l)->head != NULL) {
		node *p = (*l)->head;
		(*l)->head = (*l)->head->next;
		
		free(p);
	}
}

enum colors {
	WHITE = 0,
	GRAY,
	BLACK
};

struct tree {
	int n;
	list **adj;
	int *positions;
};

tree* create_tree(int size)
{
	tree *t = (tree*)calloc(1, sizeof(tree));
	t->n = size;
	t->adj = (list**)calloc(size, sizeof(list*));
	t->positions = (int*)calloc(size, sizeof(int));

	for (int i = 0; i < size; i++)
		t->positions[i] = -1;
	return t;
}

void add_tree_edge(tree *t, int v1, int v2, int w)
{
	if (t->adj[v1] == NULL) 
		t->adj[v1] = create_list();

	insert_list(t->adj[v1], v2, w);
}

void destroy_tree(tree **t)
{
	for (int i = 0; i < (*t)->n; i++) {
		if ((*t)->adj[i])
			destroy_list(&((*t)->adj[i]));
	}

	free((*t)->adj);
	free((*t)->positions);
	free(*t);
}

void dfs(tree *t, int source)
{
	if (t->positions[source] == -1)
		t->positions[source] = dfs_size;
	a[dfs_size++] = source;

	node *n = NULL;
	if (t->adj[source]) {
		n = t->adj[source]->head;
		while (n) {
			dfs(t, n->value);
			a[dfs_size++] = source;

			n = n->next;
		}
	}
}

// we initialize m[i][j] tp hold the min in interval [i, i + 2 ^j]
void initialize(int n)
{
    for (int i = 0; i < n; i++)
        m[i][0] = i;

    for (int j = 1; (1 << j) <= n; j++) {
        for (int i = 0; (i + (1 << j) - 1) < n; i++) {
            int a1 = a[m[i][j - 1]];
            int a2 = a[m[i + (1 << (j - 1))][j - 1]];

            m[i][j] = (a1 < a2) ? m[i][j - 1] : m[i + (1 << (j - 1))][j - 1];
        }
    }
}

// Query for the min in [x, y] through <node>
int query(int i, int j)
{
    int k = log(j - i + 1) / log(2);

    int a1 = a[m[i][k]];
    int a2 = a[m[j - (1 << k) + 1][k]];

    return (a1 < a2) ? m[i][k] : m[j - (1 << k) + 1][k];
}


int main()
{
	int n, m;
	tree *t = NULL;

	freopen("lca.in", "r", stdin);
	freopen("lca.out", "w", stdout);

	scanf("%d %d\n", &n, &m);
	t = create_tree(n);

	for (int i = 0; i < (n - 1); i++) {
		int parent;
		scanf("%d ", &parent);
		
		add_tree_edge(t, parent - 1, i + 1, 0);
	}

	dfs_size = 0;
	dfs(t, 0);
	initialize(dfs_size);

	for (int i = 0; i < m; i++) {
		int u, v;
		scanf("%d %d\n", &u, &v);

		int p1 = t->positions[u - 1];
		int p2 = t->positions[v - 1];
		int q = -1;
		if (p1 < p2)
			q = query(p1, p2);
		else
			q = query(p2, p1);
		printf("%d\n", a[q] + 1);
	}

	destroy_tree(&t);

	return 0;
}