#include <iostream>

 #include <cstdio>

 #include <vector>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 const int INF=0x3f3f3f3f;

 typedef long long ll;

 const int maxn=1e6+;

 ll n,k,m;

 ll ans;

 ll a[maxn];

 ll b[maxn];

 ll c[maxn];

 int degree[maxn];

 vector<int> G[maxn];

 int lowbit(int x)

 {

     return x&-x;

 }

 int sum(int x)

 {

     int ret = ;

     while(x>)

     {

         ret+=c[x]; x-=lowbit(x);

     }

     return ret;

 }

 void add(int x, int d)

 {

     while(x<=m)

     {

         c[x]+=d;

         x+=lowbit(x);

     }

 }

 void dfs(int u, int fa)

 {

     int update_pos=lower_bound(b+,b+m+,a[u])-b;

     int query_pos;

     if(a[u]) query_pos=lower_bound(b+,b+m+,k/a[u])-b;

     else query_pos=m;

     ans+=sum(query_pos);

     add(update_pos,);

     for(int i=;i<G[u].size();i++)

     {

         int v=G[u][i];

         if(v==fa) continue;

         dfs(v,u);

     }

     add(update_pos,-);

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

     int T;

     scanf("%d",&T);

     while(T--)

     {

         memset(c,,sizeof(c));

         memset(degree,,sizeof(degree));

         scanf("%lld%lld",&n,&k);

         for(int i=;i<=n;i++)  {G[i].clear();scanf("%lld",&a[i]);b[i]=a[i];}

         m=n;

         for(int i=;i<=n;i++)

         {

             if(a[i])  b[++m]=k/a[i];

         }

         sort(b+,b+m+);

         m=unique(b+,b+m+)-(b+);

         for(int i=;i<=n-;i++)

         {

             int u,v;

             scanf("%d%d",&u,&v);

             G[u].push_back(v);

             G[v].push_back(u);

             degree[v]++;

         }

         ans=;

         for(int i=;i<=n;i++)

             if(degree[i]==)  dfs(i,-);

         printf("%lld\n",ans);

     }

     return ;

 }