#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
map<ll,int>pm;
ll a[MAXN],b[MAXN],ans[MAXN];
int sub[MAXN],F[MAXN*2];
vector<int>adj[MAXN];
void pre(int nd){
	sub[nd]=1;
	for(int i=0;i<int(adj[nd].size());i++){
		int to=adj[nd][i];
		pre(to);
		sub[nd]+=sub[to];
	}
}
void upd(int x){
	for(;x<MAXN*2;x+=x&(-x))
		F[x]++;
}
int tap(int x){
	int res=0;
	for(;x;x-=x&(-x))
		res+=F[x];
	return res;	
}
int add(int nd,int root){
	//~ cout<<"add "<<nd<<endl;
	int res=(a[nd]<=b[root]);
	tr(it,adj[nd])
		res+=add(*it,root);
	return res;	
}
void update(int nd){
	//~ cout<<"del "<<nd<<endl;
	upd(a[nd]);
	tr(it,adj[nd])
		update(*it);
}
void dfs(int nd,bool keep){
	int mx=-1,who=-1;
	for(int i=0;i<int(adj[nd].size());i++){
		int to=adj[nd][i];
		if(umax(mx,sub[to]))
			who=to;
	}
	for(int i=0;i<int(adj[nd].size());i++){
		int to=adj[nd][i];
		if(to==who)
			continue;
		dfs(to,0);	
	}
	if(~who)
		dfs(who,1);
	int cnt=tap(b[nd]);	
	for(int i=0;i<int(adj[nd].size());i++){
		int to=adj[nd][i];
		if(to==who)
			continue;
		int res=add(to,nd);	
		ans[nd]+=cnt*1LL*res;
		cnt+=res;	
	}
	if(a[nd]<=b[nd])
		ans[nd]+=cnt;
	ans[nd]*=2;
	if(a[nd]<=b[nd])
		ans[nd]++;
	if(keep){
		upd(a[nd]);
		for(int i=0;i<int(adj[nd].size());i++){
			int to=adj[nd][i];
			if(to==who)
				continue;
			update(to);	
		}
	}
}
int main(){
    //~ freopen("file.in", "r", stdin);
    int n;
    scanf("%d",&n);
    for(int i=2;i<=n;i++){
		int p;
		scanf("%d",&p);
		adj[p].pb(i);
	}
	for(int i=1;i<=n;i++)
		scanf("%lld",a+i),pm[a[i]]=1;
	for(int i=1;i<=n;i++)
		scanf("%lld",b+i),pm[b[i]]=1;
	int c=0;
	tr(it,pm)
		it->ss=++c;
	for(int i=1;i<=n;i++)
		a[i]=pm[a[i]];
	for(int i=1;i<=n;i++)
		b[i]=pm[b[i]];
	pre(1);	
	dfs(1,0);	
	for(int i=1;i<=n;i++)
		printf("%lld\n",ans[i]);
	return 0;
}