#include <bits/stdc++.h>

 using namespace std;

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 typedef long long LL;

 const int maxn = ;

 int n, rt;

 int in[maxn];

 LL k, ret, a[maxn];

 vector<int> G[maxn];

 LL h[maxn];

 int hcnt;

 LL sum[maxn<<];

 inline int getid(LL x) {

   return lower_bound(h, h+hcnt, x) - h + ;

 }

 void pushUP(int rt) {

   sum[rt] = sum[lrt] + sum[rrt];

 }

 void build(int l, int r, int rt) {

   sum[rt] = ;

   if(l == r) return;

   int mid = (l + r) >> ;

   build(l, mid, lrt);

   build(mid+, r, rrt);

   pushUP(rt);

 }

 void update(int l, int r, int rt, int pos, LL val) {

   if(l == r) {

     sum[rt] += val;

     return;

   }

   int mid = (l + r) >> ;

   if(pos <= mid) update(l, mid, lrt, pos, val);

   else update(mid+, r, rrt, pos, val);

   pushUP(rt);

 }

 LL query(int L, int R, int l, int r, int rt) {

   if(l >= L && R >= r) return sum[rt];

   int mid = (l + r) >> ;

   LL ret = ;

   if(L <= mid) ret += query(L, R, l, mid, lrt);

   if(mid < R) ret += query(L, R, mid+, r, rrt);

   return ret;

 }

 void dfs(int u) {

   int uu = getid(a[u]);

   int vv = getid(k/a[u]);

   ret += query(, vv, , hcnt, );

   update(, hcnt, , uu, );

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

   update(, hcnt, , uu, -);

 }

 int main() {

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

   int T, u, v;

   scanf("%d", &T);

   while(T--) {

     scanf("%d %I64d",&n,&k);

     memset(in, , sizeof(in)); hcnt = ; ret = ;

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

       scanf("%I64d", &a[i]);

       G[i].clear();

       h[hcnt++] = a[i]; h[hcnt++] = k / a[i];

     }

     sort(h, h+hcnt); hcnt = unique(h, h+hcnt) - h;

     build(, hcnt, );

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

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

       G[u].push_back(v);

       in[v]++;

     }

     for(int i = ; i <= n; i++) if(!in[i]) dfs(i);

     printf("%I64d\n", ret);

   }

   return ;

 }