# include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5; 
int n, p1[N]; 
vector <pair<int, int> > g[N]; 
int d[N], fa[22][N], dep[N]; 
void dfs(int x, int fa)
{
    dep[x] = dep[fa] + 1, ::fa[0][x] = fa; 
    for(int i = 1; i <= 20; i++) ::fa[i][x] = ::fa[i - 1][::fa[i - 1][x]]; 
    for(auto [v, w] : g[x])
    {
        dfs(v, x); 
    }
    return; 
}

int LCA(int x, int y)
{
    if(dep[x] > dep[y]) swap(x, y); 
    for(int i = 20; i >= 0; i--) 
        if(dep[x] + (1 << i) <= dep[y]) y = fa[i][y]; 
    if(x == y) return x; 
    for(int i = 20; i >= 0; i--)
        if(fa[i][x] != fa[i][y]) x = fa[i][x], y = fa[i][y]; 
    return fa[0][x]; 
}
int ans = 0; 
void dfs2(int x, int fa)
{
    for(auto [v, w] : g[x])
    {
        dfs2(v, x); 
        d[x] += d[v]; 
        if(d[v] > 1 && w > 0) ++ans; 
    }
    return; 
}

int main(void)
{
    int Test; scanf("%d", &Test); 
    while(Test--)
    {
        scanf("%d", &n); 
        for(int i = 1; i <= n; i++) d[i] = 0, dep[i] = 0, g[i].clear(); 
        for(int i = 2; i <= n; i++) scanf("%d", &p1[i]); 
        for(int i = 2; i <= n; i++) 
        {
            int v; scanf("%d", &v); 
            g[p1[i]].push_back({i, v}); 
        }
        dfs(1, 0); 
        for(int i = 2; i <= n; i++)
        {
            int f; scanf("%d", &f); 
            // egde (f, i)
            int lca = LCA(f, i);
            // printf("(%d, %d), lca = %d\n", f, i, lca);  
            d[lca] -= 2, d[f]++, d[i]++; 
        }
        ans = 0; 
        dfs2(1, 0); 
        printf("%d\n", ans); 
    }
    return 0; 
}