#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<unordered_map>
#include<time.h>
#include<cstdlib>
#include <chrono>
#include <random>
typedef long long ll;
typedef unsigned long long ull;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
//#pragma comment(linker, "/STACK:36777216") //hdu 扩栈
#define mm(a) memset(a,0,sizeof(a))
#define lr rt<<1
#define rr rt<<1|1
#define sync std::ios::sync_with_stdio(false);std::cin.tie(0);
#define inf 0x3f3f3f3f
#define eqs 1e-8
#define lb(x) (x&(-x))
#define ch(a) (int(a-'a')+1)
#define rep(i, a, b) for(int i=a;i<=b;i++)
#define mkp(a, b) make_pair(a,b)
#define re register
#define umap(a) (a).reserve(1024);(a).max_load_factor(0.25);
using namespace std;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<pii,int> piii;
//const double pi=acos(-1);
const int maxn=500005;
//const ll Mod=1000000007;
const ll Mod=998244353;


int q[maxn];
vector<int>g[maxn];
int c[maxn];
int fa[maxn];
int dep[maxn];


void dfs(int u)
{
    for(int v:g[u])
    {
        dep[v]=dep[u]+1;
        dfs(v);
    }
}

bool cmp(int u,int v)
{
    return dep[u]>dep[v];
}

bool vis[maxn];


int findfa(int u,int k)
{
    int cnt=0;
    while(u!=1&&cnt<k)
    {
        u=fa[u];
        cnt++;
    }
    return u;
}

void col(int u,int k)
{
//    cout<<u<<' ';
    vis[u]=1;
    if(k<=0)
        return;
    for(int v:g[u])
    {
        col(v,k-1);
    }
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,k;
        scanf("%d%d",&n,&k);
        int u,v;
        for(int i=1;i<=n;i++)
        {
            g[i].clear();
            q[i]=i;
            vis[i]=0;
        }
        for(int i=2;i<=n;i++)
        {
            scanf("%d",&u);
            fa[i]=u;
            g[u].push_back(i);
        }
        for(int i=1;i<=n;i++)
            scanf("%d",&c[i]);
        dep[1]=0;
        dfs(1);
        sort(q+1,q+n+1,cmp);
        int ans=0,fu;
        for(int i=1;i<=n;i++)
        {
            u=q[i];
//            cout<<u<<endl;
            if(vis[u])
                continue;
            if(c[u]==0)
                continue;
            fu=findfa(u,k);
//            cout<<u<<' '<<fu<<endl;
            if(vis[fu]==0)
                ans++;
            col(fu,k);
//            cout<<endl;
        }
        printf("%d\n",ans);
    }
    return 0;
}