#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 10;

int n;
int psz = 0;
vector<int> G[maxn];
int dfn[maxn];
int sz[maxn];
int a[maxn];
set<int> stc;
map<int, int> mp;
queue<pair<int, int> > Q[maxn];
queue<pair<int, int> > ans; // id, is_stuck

void dfs(int u, int p) {
	dfn[u] = ++psz;
	sz[u] = 1;
	for (auto v : G[u]) {
		dfs(v, u);
		sz[u] += sz[v];
	}
}

void add(int u, int flag) {
	int isok = false;
	for (int stucked : stc) {
		stucked = -stucked;
		if (dfn[u] > dfn[stucked] && dfn[u] < dfn[stucked] + sz[stucked]) {
			// in stucked subtree
			Q[stucked].push(make_pair(u, flag));
			isok = true;
			break;
		}
	}
	if (flag) stc.insert(-u);
	if (!isok) ans.push(make_pair(u, flag));
}

void solve(int u) {
	while (!Q[u].empty()) {
		auto v = Q[u].front();
		Q[u].pop();
		if (v.second == 0) {
			cout << v.first << " ";
		} else {
			solve(v.first);
		}
	}
	cout << u << " ";
}

int main() {
	cin >> n;
	for (int i = 2;i <= n;++i) {
		int x;
		cin >> x;
		G[x].push_back(i);
	}
	for (int i = 1;i <= n;++i) {
		cin >> a[i];
		mp[a[i]] = i;
	}
	dfs(1, 0);
	for (int i = 1;i <= n;++i) {
		int u = mp[i];
		if (G[u].size() == 0) {
			add(u, 0);
		} else {
			add(u, 1);
		}
	}
	
	int cnt = 0;
	while (!ans.empty()) {
		auto u = ans.front();
		// cout << endl << ++cnt << " " << u.first << " " << u.second << endl;
		ans.pop();
		if (u.second == 0) {
			cout << u.first << " ";
		} else {
			solve(u.first);
		}
	}
	return 0;
}