#include<bits/stdc++.h>
using namespace std;
int read(){
    int red=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){ if(ch=='-') f=-f;ch=getchar();}
    while(ch>='0'&&ch<='9') red=red*10+ch-48,ch=getchar();
    return red*f;
}
const int N=1e5+5;
int n,ans[N],dp[N],id[N],low[N],to[N],fz[N];
char s[N];
vector<int>V[N];
deque<int>f[N][2];
void dfs(int x){
    low[x]=1e9;
    dp[x]=(s[x]=='1');
    int num=0;
    for(auto v:V[x]){
        dfs(v);num++;
        dp[x]+=dp[v];
        low[x]=min(low[x],low[v]+1);
    }
    if(!num){
        id[x]=x;low[x]=1;ans[x]=0;
        if(s[x]=='1') f[x][0].push_back(-1);
        else f[x][1].push_back(1);
    }else if(num==1){
        int v=V[x][0];
        id[x]=id[v];ans[x]=ans[v];
        if(s[x]=='1') f[id[x]][0].push_back(-1);
        else f[id[x]][1].push_back(1);
    }else{
        id[x]=x;ans[x]=dp[x];
        for(int i=1;i<low[x];i++){
            int now=0;
            for(int v:V[x]){
                if(!f[id[v]][0].empty())
                    now+=f[id[v]][0].front(),f[id[v]][0].pop_front();
                else if(fz[id[v]]) fz[id[v]]--;
                else now+=f[id[v]][1].front(),f[id[v]][1].pop_front();
            }
            // printf("%d %d\n",x,now);
            if(now<0) f[x][0].push_back(now),ans[x]+=now;
            else if(now==0) fz[x]++;
            else f[x][1].push_back(now);
        }
        if(s[x]=='1') f[x][0].push_back(-1),ans[x]--;
        else f[x][1].push_front(1);
    }
}
void clear(){
    for(int i=1;i<=n;i++) V[i].clear();
    for(int i=1;i<=n;i++){
        f[i][0].clear();
        f[i][1].clear();
        fz[i]=0;
    }
}
int main(){
    #ifdef __LOCAL__
    freopen("D.in","r",stdin);
    freopen("D.out","w",stdout);
    #endif
    int t=read();
    while(t--){
        clear();
        n=read();
        scanf("%s",s+1);
        for(int i=2;i<=n;i++)
            V[read()].push_back(i);
        dfs(1);
        for(int i=1;i<n;i++) printf("%d ",ans[i]);
        printf("%d\n",ans[n]);
    }
    return 0;
}