#include<bits/stdc++.h>
using namespace std;
const int N=4005;
typedef long long ll;
int n,a[N];
ll s[N],f[N][N],ans[N];
vector<int>e[N];
void dfs(int x,int d){
	f[d][d]=a[x],s[d]=s[d-1]+a[x];
	for(int i=d-1,j=d-1;i;--i){
		while(j>i&&f[i][j-1]+f[j][d]<=f[i][j]+f[j+1][d])--j;
		f[i][d]=f[i][j]+f[j+1][d]+s[d]-s[i-1];
	}
	ans[x]=f[1][d];
	for(auto v:e[x])dfs(v,d+1);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i)scanf("%d",&a[i]);
	for(int i=2,x;i<=n;++i){
		scanf("%d",&x);
		e[x].push_back(i);
	}
	dfs(1,1);
	for(int i=1;i<=n;++i)printf("%lld\n",ans[i]);
	return 0;
}