#include<bits/stdc++.h>

 #define pa pair<int,int>

 #define lowb(x) ((x)&(-(x)))

 #define REP(i,n0,n) for(i=n0;i<=n;i++)

 #define PER(i,n0,n) for(i=n;i>=n0;i--)

 #define MAX(a,b) ((a>b)?a:b)

 #define MIN(a,b) ((a<b)?a:b)

 #define CLR(a,x) memset(a,x,sizeof(a))

 #define rei register int

 using namespace std;

 typedef long long ll;

 const int maxn=1e6+;

 inline ll rd(){

     ll x=;char c=getchar();int neg=;

     while(c<''||c>''){if(c=='-') neg=-;c=getchar();}

     while(c>=''&&c<='') x=x*+c-'',c=getchar();

     return x*neg;

 }

 int N,v[maxn],q[maxn];

 int ch[maxn],hd[maxn];

 int cnt[maxn],ans[maxn];

 void dfs(int x,int f){

     int cc=cnt[q[x]];cnt[v[x]]++;

     for(int i=hd[x];i;i=ch[i]){

         if(i==f) continue;

         dfs(i,x);

     }ans[x]=cnt[q[x]]-cc;

 }

 int main(){

     //freopen(".in","r",stdin);

     rei i,j,k;

     N=rd();

     for(i=;i<=N;i++) v[i]=rd(),q[i]=rd();

     for(i=;i<=N;i++){

         int a=rd();

         ch[i]=hd[a];hd[a]=i;

     }

     dfs(,);

     for(i=;i<=N;i++) printf("%d\n",ans[i]);

     return ;

 }