#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
const int N=200005;
struct edge{int to,next;}w[N<<1];
int n,h[N],cnt,T,a[N];
char s[N];
void Add(int x,int y){
    w[++cnt].to=y,w[cnt].next=h[x],h[x]=cnt;
}
int hd[N],ng[N],ans[N],sv[N];
set<int>S[N];
void DFS(int u){
    int i;hd[u]=a[u];
    for(i=h[u];i;i=w[i].next){
        int e=w[i].to;
        DFS(e);hd[u]+=hd[e];
        if(!S[u].size())S[u]=S[e],ng[u]=ng[e];
        else{
            set<int>::iterator it=S[u].begin(),jt=S[e].begin();
            int pos=0;
            while(it!=S[u].end()&&jt!=S[e].end()){
                sv[++pos]=*it+*jt;
                it++;jt++;
            }
            S[u].clear();ng[u]=0;
            while(pos){
                if(sv[pos]<0)ng[u]+=sv[pos];
                S[u].insert(sv[pos]),pos--;
            }
        }
    }
    if(a[u]==0)S[u].insert(1);else S[u].insert(-1),ng[u]--;
    ans[u]=hd[u]+ng[u];
}
int main(){
    int i,x;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);scanf("%s",s+1);cnt=0;
        for(i=1;i<=n;i++)a[i]=s[i]-'0',h[i]=ng[i]=ans[i]=hd[i]=0,S[i].clear();
        for(i=2;i<=n;i++)scanf("%d",&x),Add(x,i);DFS(1);
        for(i=1;i<=n;i++)printf("%d ",ans[i]);putchar('\n');
    }
    return 0;
}