#include<bits/stdc++.h>
using namespace std;
const int MAXN=100010;
const int INF=1e9;
int n;
char ch[MAXN];
int col[MAXN];
int cnt[MAXN];
int ans[MAXN];
vector<int> T[MAXN];
priority_queue<int> pq[MAXN];
void dfs(int u){
    if(!T[u].size()){
        if(col[u])pq[u].push(1);
        else pq[u].push(-1);
        return;
    }
    bool flag=false;
    for(auto v: T[u]){
        dfs(v);
        cnt[u]+=cnt[v];
        if(!flag){
            swap(pq[u],pq[v]);
            flag=true;
            ans[u]=ans[v];
            continue;
        }
        static int tmp[MAXN];
        int len=min(pq[u].size(),pq[v].size());
        int sum=0;
        for(int i=0;i<len;++i){
            tmp[i]=pq[u].top()+pq[v].top();
            pq[u].pop(),pq[v].pop();
        }
        while(!pq[u].empty())pq[u].pop();
        for(int i=0;i<len;++i){
            pq[u].push(tmp[i]);
            if(tmp[i]>0)sum+=tmp[i];
            tmp[i]=0;
        }
        if(v==T[u].back()){
            ans[u]=cnt[u]-sum;
            // cout<<u<<":::"<<cnt[u]<<' '<<sum<<endl;
        }
    }
    if(col[u])pq[u].push(1),ans[u]-=(T[u].size()>1);
    else pq[u].push(-1);
    priority_queue<int> tmp;
    tmp=pq[u];
    // cout<<u<<":"<<cnt[u]<<endl;
    // while(!tmp.empty())cout<<-tmp.top()<<' ',tmp.pop();
    // cout<<endl;
}
int main(){
    int testcase;
    scanf("%d",&testcase);
    while(testcase--){
        scanf("%d",&n);
        scanf("%s",ch+1);
        for(int i=1;i<=n;++i){
            col[i]=ch[i]-'0';
            cnt[i]=col[i];
        }
        for(int i=2;i<=n;++i){
            int p;
            scanf("%d",&p);
            T[p].push_back(i);
        }
        dfs(1);
        for(int i=1;i<=n;++i){
            printf("%d",ans[i]);
            if(i<n)putchar(' ');
        }
        putchar('\n');
        for(int i=1;i<=n;++i){
            T[i].clear();
            cnt[i]=col[i]=ans[i]=0;
            while(!pq[i].empty())pq[i].pop();
        }
    }
}