#include <bits/stdc++.h>
using namespace std;
int T,n,i,j,ii,jj,e,x,z,ka[100100],kb[100100],a[100100],b[100100],c[100100],d[100100],s[100100];
long long r[100100],cur;
vector<int> g[100100];
bool cmpa(int i, int j) { return a[i]<a[j]; }
bool cmpb(int i, int j) { return b[i]<b[j]; }
void dfs(int i) {
  c[i]=++T;
  for (int j=0; j<g[i].size(); j++) dfs(g[i][j]);
  d[i]=T;
}
int main() {
  scanf("%d",&n);
  for (i=2; i<=n; i++) {
    scanf("%d",&x);
    g[x].push_back(i);
  }
  for (i=1; i<=n; i++) { scanf("%d",&a[i]); ka[i-1]=i; }
  for (i=1; i<=n; i++) { scanf("%d",&b[i]); kb[i-1]=i; }
  sort(ka,ka+n,cmpa);
  sort(kb,kb+n,cmpb);
  dfs(1);
  for (ii=j=0; ii<n; ii++) {
    i=kb[ii];
    for (; j<n && a[ka[j]]<=b[i]; j++)
      for (e=c[ka[j]]; e<=n; e=(e<<1)-(e&(e-1))) s[e]++;
    cur=int(a[i]<=b[i]);
    for (jj=0; jj<g[i].size(); jj++) {
      x=g[i][jj]; z=0;
      for (e=d[x]; e>0; e&=e-1) z+=s[e];
      for (e=c[x]-1; e>0; e&=e-1) z-=s[e];
      r[i]+=cur*z;
      cur+=z;
    }
    r[i]*=2;
    if (a[i]<=b[i]) r[i]++;
  }
  for (i=1; i<=n; i++) printf("%lld\n",r[i]);
  return 0;
}