#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
int T;
int ans[N];
char s[N];
vector <int> e[N];
vector <int> cf;
pair<int, vector<int> > dfs(int sn) 
{
	cf.clear();
    int v = 0;
    for (int i : e[sn]) 
	{
        auto [val,depth] = dfs(i);
        v += val;
        if (cf.empty()) 
		{
            cf = depth;
        } 
		else 
		{
            int sz = min(cf.size(), depth.size());
            for (int i = 0; i < sz; i++)
			{
                cf[i] += depth[i];
            }
        }
    }
    v += s[sn] - '0';
    if (s[sn] == '0') 
	{
        cf.push_back(1);
    } 
	else 
	{
        cf.push_back(-1);
        for (int& d : cf) d--;
    }
    ans[sn] = v + accumulate(begin(cf), end(cf), 0);
    return {v, cf};
}

int main() 
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> T;
    while (T--) 
	{
        cin >> n;
		scanf("%s",s + 1);
        for (int i = 1; i <= n; i++) 
		{
            e[i].clear();
        }
		int x;
        for (int i = 2; i <= n; i++) 
		{
            cin >> x;
            e[x].push_back(i);
        }
        dfs(1);
        for (int i = 1; i <= n; i++) 
		{
            cout << ans[i];
        }
        cout << endl;
    }
    return 0;
}