// Problem: A. t1
// Contest: undefined - NOIP2024训练赛 04
// URL: http://www.noi.ac/contest/1156/problem/582
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
//#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 2e5 + 10, M = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;

int n, m, q, ti, cnt;
int s[N], dp[N], sum[N], dfl[N], dfr[N], id[N], fa[N];

vector<int> e[N], ans;

void dfs(int now, int f)
{
	dfl[now] = ++ ti, id[ti] = now;
	for(auto i : e[now])
	{
		if(i == f) continue;
		dfs(i, now);
	}
	dfr[now] = ti;
}

struct Tree
{
	int l, r;
	PII mn;
}tr[N << 2];

inline PII MN(PII a, PII b) 
{
	if(a.fi < b.fi) return a;
	else return b;
}

inline void pushup(int x) {tr[x].mn = MN(tr[2 * x].mn, tr[2 * x + 1].mn);}

void build(int x, int l, int r)
{
	tr[x].l = l, tr[x].r = r;
	if(l == r)
	{
		tr[x].mn = {s[id[l]], id[l]};
		return;
	}
	int mid = l + r >> 1;
	build(2 * x, l, mid);
	build(2 * x + 1, mid + 1, r);
	pushup(x);
}

PII query(int x, int l, int r)
{
	if(tr[x].l >= l && tr[x].r <= r) return tr[x].mn;
	int mid = tr[x].l + tr[x].r >> 1; PII res = {INF + 5, 0};
	if(l <= mid) res = MN(res, query(2 * x, l, r));
	if(r > mid) res = MN(res, query(2 * x + 1, l, r));
	return res;
}

void change(int x, int p)
{
	if(tr[x].l == tr[x].r) 
	{
		tr[x].mn.fi = INF;
		return;
	}
	int mid = tr[x].l + tr[x].r >> 1;
	if(p <= mid) change(2 * x, p);
	else change(2 * x + 1, p);
	pushup(x);
}

void solve(int now)
{
	// if(++ cnt >= 30) exit(0);
	// cout << "now = " << now << '\n';
	int l = dfl[now] + 1, r = dfr[now];
	if(l > r) 
	{
		ans.push_back(now); change(1, dfl[now]); 
		return;
	}
	while(1)
	{
		PII x = query(1, l, r);
		// cout << "sum = " << x.fi << " to = " << x.se << '\n';
		if(x.fi >= INF)
		{
			ans.push_back(now); change(1, dfl[now]); 
			break;
		}
		else solve(x.se);
	}
	
}

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for(int i = 2; i <= n; i ++)
	{
		int x; cin >> x; fa[i] = x;
		e[i].push_back(x), e[x].push_back(i);
	}
	for(int i = 1; i <= n; i ++) cin >> s[i];
	dfs(1, 0); build(1, 1, n);
	// cout << dfl[3] << ' ' << dfr[3] << '\n';
	// cout << fa[3] << '\n';
	solve(1);
	for(auto i : ans) cout << i << ' ';
	return 0;
}