#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

const int maxn =  + ;

int ans[maxn];

int son[maxn]; //第u个点有多少个儿子。

int fa[maxn]; //记录第i个点的爸爸是谁

struct node {

    int u, v, tonext;

}e[maxn];

int first[maxn];

int num;

void add(int u, int v) {

    ++num;

    e[num].u = u;

    e[num].v = v;

    e[num].tonext = first[u];

    first[u] = num;

}

void dfs(int cur, int from) {

    son[cur] = ; //自己一个

    ans[cur] = cur; //叶子节点

    int mx = -inf, pos = cur; //以这个点为子树的儿子数最多的那个pos

    for (int i = first[cur]; i; i = e[i].tonext) {

        dfs(e[i].v, cur);

        son[cur] += son[e[i].v]; //加上儿子的节点个数

        if (mx < son[e[i].v]) { //不能算自己，只能算儿子的max

            mx = son[e[i].v];

            pos = e[i].v;  //儿子数最多的那个节点，

        }

    }

    ans[cur] = ans[pos]; //ans[pos]已经算出来了，ans[pos]的重心

    while (son[cur] >  * son[ans[cur]]) {

        ans[cur] = fa[ans[cur]]; //暴力往上找

    }

}

void work() {

    int n;

    cin >> n;

    int q;

    cin >> q;

    for (int i = ; i <= n; ++i) {

        int x;

        cin >> x;

        add(x, i);

        fa[i] = x;

    }

    dfs(, -);

    for (int i = ; i <= q; ++i) {

        int x;

        cin >> x;

        cout << ans[x] << endl;

    }

}

int main() {

#ifdef local

    freopen("data.txt","r",stdin);

#endif

    IOS;

    work();

    return ;

}