//By SiriusRen#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N=100050;int n,col[N],cpy[N],tree[N*100],lson[N*100],rson[N*100],cnt,root[N];int first[N],next[N],v[N],tot,ans[N],fa[N];void add(int x,int y){v[tot]=y,next[tot]=first[x],first[x]=tot++;}void insert(int l,int r,int &pos,int num,int wei){    pos=++cnt,tree[pos]+=wei;    if(l==r)return;    int mid=(l+r)>>1;    if(mid<num)insert(mid+1,r,rson[pos],num,wei);    else insert(l,mid,lson[pos],num,wei);}int merge(int now,int last){    if(!now||!last)return now^last;    lson[now]=merge(lson[now],lson[last]);    rson[now]=merge(rson[now],rson[last]);    tree[now]=tree[lson[now]]+tree[rson[now]];    return now;}int query(int l,int r,int pos,int L,int R){    if(l>=L&&r<=R)return tree[pos];    int mid=(l+r)>>1;    if(mid<L)return query(mid+1,r,rson[pos],L,R);    else if(mid>=R)return query(l,mid,lson[pos],L,R);    else return query(l,mid,lson[pos],L,R)+query(mid+1,r,rson[pos],L,R);}void dfs(int x){    insert(0,n,root[x],col[x],1);    for(int i=first[x];~i;i=next[i])if(v[i]!=fa[x])dfs(v[i]);    for(int i=first[x];~i;i=next[i])if(v[i]!=fa[x])root[x]=merge(root[x],root[v[i]]);    ans[x]=query(0,n,root[x],col[x]+1,n);}int main(){    memset(first,-1,sizeof(first));    scanf("%d",&n);    for(int i=1;i<=n;i++)scanf("%d",&col[i]),cpy[i]=col[i];    sort(cpy+1,cpy+1+n);    for(int i=1;i<=n;i++)col[i]=lower_bound(cpy+1,cpy+1+n,col[i])-cpy-1;    for(int i=2;i<=n;i++)scanf("%d",&fa[i]),add(fa[i],i);    dfs(1);    for(int i=1;i<=n;i++)printf("%d\n",ans[i]);}