#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
mt19937_64 rnd(228);
typedef unsigned long long ull;
const int maxN = 1e6 + 10;
ull f[maxN];
int n;
int p[maxN];
int val[maxN];
ull f0[maxN], f1[maxN];
int p2[maxN];
vector<int> g[maxN];
vector<int> g2[maxN];
void dfs(int v, int p) {
    f0[v] ^= f[v];
    for (int to : g[v]) {
        if (to == p) continue;
        dfs(to, v);
        f0[v] ^= f0[to];
    }
}
void dfs2(int v, int p) {
    f1[v] ^= f[v];
    for (int to : g2[v]) {
        if (to == p) continue;
        dfs2(to, v);
        f1[v] ^= f1[to];
    }
}
void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        f[i] = rnd();
        f0[i] = f1[i] = 0;
        g[i].clear();
        g2[i].clear();
    }
    for (int i = 2; i <= n; i++) {
        cin >> p[i];
        g[i].emplace_back(p[i]);
        g[p[i]].emplace_back(i);
    }
    for (int i = 2; i <= n; i++) {
        cin >> val[i];
    }
    for (int i = 2; i <= n; i++) {
        cin >> p2[i];
        g2[i].emplace_back(p2[i]);
        g2[p2[i]].emplace_back(i);
    }
    dfs(1, -1);
    dfs2(1, -1);
    unordered_map<ull,int> mp;
    for (int i = 2; i <= n; i++) {
        mp[f1[i]]++;
    }
    int ans = 0;
    for (int i = 2; i <= n; i++) {
        if (val[i] > 0 && !mp.count(f[i])) {
            ans++;
        }
    }
    cout << ans << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }
    return 0;
}