#include <iostream>
#include <vector>
#include <string>

using namespace std;

void solve() {
    int n;
    cin >> n;
    
    vector<int> p(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
    }
    
    string s;
    cin >> s;
    
    vector<int> ans(n + 1, 0);
    vector<bool> visited(n + 1, false);
    
    for (int i = 1; i <= n; i++) {
        if (!visited[i]) {
            vector<int> cycle;
            int curr = i;
            int black_count = 0;
            
            while (!visited[curr]) {
                visited[curr] = true;
                cycle.push_back(curr);
                if (s[curr - 1] == '0') {
                    black_count++;
                }
                curr = p[curr];
            }
            
            for (int node : cycle) {
                ans[node] = black_count;
            }
        }
    }
    
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << (i == n ? "" : " ");
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}