#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 2e5+5;
vector<int>adj[MAXN];
string s;
multiset<int>dp[MAXN];
int best[MAXN],sum[MAXN],ans[MAXN];
void dfs(int v){
    dp[v].clear();
    sum[v] = best[v] = 0;
    for(int x:adj[v]){
        dfs(x);
        if(dp[v].empty()){
            best[v] = best[x];
            sum[v] = sum[x];
            dp[v] = dp[x];
        }else{
            if(sz(dp[v]) > sz(dp[x])){
                swap(dp[v],dp[x]);
                swap(best[v],best[x]);
            }
            vector<int>c;
            auto it = dp[x].begin();
            sum[v] = 0;
            for(int val:dp[v]){
                c.pb(val+*it);
                if(val + *it <= 0)sum[v] += val + *it;
                it++;
            }
            best[v]+=best[x];
            dp[v] = multiset<int>(c.begin(),c.end());
        }
    }
    if(s[v]=='0')dp[v].insert(1);
    else {
        dp[v].insert(-1);
        best[v]++;
        sum[v]--;
    }
    ans[v] = best[v] + sum[v];
}
int main()
{
    owo
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        cin>>s;
        for(int i=1;i<n;i++){
            int p;
            cin>>p;
            adj[p-1].pb(i);
        }
        dfs(0);
        for(int i=0;i<n;i++){
            cout<<ans[i];
            if(i!=n-1)cout<<" ";
        }
        cout<<'\n';
        for(int i=0;i<n;i++)adj[i].clear();
    }


}