#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int mod=1e9+7;
int n,x,a[1000005],b[1000005],d[1000005],p[1000005];
int mul(int x,int y){return 1ll*x*y%mod;}
void add(int &x,const int y){x=((x+y>=mod)?(x+y-mod):(x+y));}
void sub(int &x,const int y){x=((x>=y)?(x-y):(x+mod-y));}
int qpow(int a,int b){int c=1;while(b){if(b&1)c=mul(c,a);a=mul(a,a),b>>=1;}return c;}
int dp0[1000005][2],dp1[1000005][2],dp2[1000005],dp3[1000005];
vector<int>son[1000005];
int pos[1000005],tt,Pre[1000005],Suf[1000005];
int Pre1[1000005],Suf1[1000005],Pre3[1000005],Pre2[1000005];
void dfs(int u){
	for(int v:son[u])dfs(v);
	tt=0;for(int v:son[u])pos[++tt]=v;
	Pre[0]=Suf[tt+1]=1,Pre1[0]=Suf1[tt+1]=Pre3[0]=Pre2[0]=0;
	for(int i=1;i<=tt;++i){
		Pre[i]=mul(Pre[i-1],dp0[pos[i]][0]);
		Pre1[i]=mul(Pre1[i-1],dp0[pos[i]][0]);
		add(Pre1[i],mul(Pre[i-1],dp0[pos[i]][1]));
		Pre2[i]=mul(Pre2[i-1],dp0[pos[i]][0]);
		add(Pre2[i],mul(Pre[i-1],dp2[pos[i]]));
		Pre3[i]=mul(Pre3[i-1],dp0[pos[i]][0]);
		add(Pre3[i],mul(Pre[i-1],dp3[pos[i]]));
	}
	for(int i=tt;i>=1;--i){
		Suf[i]=mul(Suf[i+1],dp0[pos[i]][0]);
		Suf1[i]=mul(Suf1[i+1],dp0[pos[i]][0]);
		add(Suf1[i],mul(Suf[i+1],dp0[pos[i]][1]));
	}
	for(int i=1;i<=tt;++i)sub(dp2[u],mul(mul(Pre[i-1],Suf[i+1]),mul(dp2[pos[i]],a[u])));
	sub(dp2[u],mul(Pre[tt],mul(a[u],x)));
	for(int i=1;i<=tt;++i)sub(dp3[u],mul(mul(Pre[i-1],Suf[i+1]),mul(dp3[pos[i]],b[u])));
	sub(dp3[u],mul(Pre[tt],mul(b[u],mod-1)));
	sub(dp1[u][0],mul(Pre[tt],mul(a[u],b[u])));
	sub(dp1[u][1],mul(Pre1[tt],mul(a[u],b[u])));
	add(dp0[u][0],mul(Pre[tt],d[u]));
	add(dp0[u][1],mul(Pre1[tt],d[u]));
	for(int i=1;i<=tt;++i){
		sub(dp0[u][1],mul(mul(Pre[i-1],Suf[i+1]),mul(dp2[pos[i]],mod-1)));
		sub(dp0[u][1],mul(mul(Pre[i-1],Suf[i+1]),mul(dp3[pos[i]],x)));
		sub(dp0[u][1],mul(mul(Pre2[i-1],Suf[i+1]),dp3[pos[i]]));
		sub(dp0[u][1],mul(mul(Pre3[i-1],Suf[i+1]),dp2[pos[i]]));
		add(dp0[u][0],mul(mul(Pre[i-1],Suf[i+1]),dp1[pos[i]][0]));
		add(dp0[u][1],mul(mul(Pre1[i-1],Suf[i+1]),dp1[pos[i]][0]));
		add(dp0[u][1],mul(mul(Pre[i-1],Suf1[i+1]),dp1[pos[i]][0]));
		add(dp0[u][1],mul(mul(Pre[i-1],Suf[i+1]),dp1[pos[i]][1]));
	}
	sub(dp0[u][1],mul(Pre[tt],mul(x,mod-1)));
}
#define getchar() p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++
static char buf[4999999], *p1 = buf, *p2 = buf;
template <typename item>
inline void read (register item &x) {
    x = 0;
	register char c = getchar();
    while (c < '0' || c > '9') c = getchar();
    while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
}
void Solve(){
	read(n),read(x);
    for(int i=1;i<=n;++i)read(d[i]),son[i].clear(),dp0[i][0]=dp0[i][1]=dp1[i][0]=dp1[i][1]=dp2[i]=dp3[i]=0,sub(d[i],x);
    for(int i=2;i<=n;++i)read(p[i]),son[p[i]].pb(i),read(a[i]),read(b[i]),sub(a[i],x),sub(b[i],x);
    dfs(1);
    int Ans=(dp0[1][0]+dp0[1][1])%mod;
    printf("%d\n",Ans);
}
int main(){
    int T;read(T);
    while(T--)Solve();
	return 0;
}