// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 1000000007
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 1000005
#define inf 0x3f3f3f3f

//boring tree dp.
//f[u][0]：已处理完u子树内的边，u子树内无X路径，u需要选与父亲相连的那条双向边（即两条单向边都选上）
//f[u][1]：已处理完u子树内的边，u子树内无X路径，u不能选与父亲相连的那条双向边
//f[u][2]：已处理完u子树内的边，u子树包含完整的X路径，u需要选与父亲相连的那条双向边
//f[u][3]：已处理完u子树内的边，u子树包含完整的X路径，u不能选与父亲相连的那条双向边
//f[u][4]：已处理完u子树内的边，X路径的终点在u子树内，起点在u子树外
//f[u][5]：已处理完u子树内的边，X路径的起点在u子树内，终点在u子树外

int n;
modint x,b[maxn],c[maxn],d[maxn];
vi e[maxn];
modint f[maxn][6],g[6];

void work()
{
	n=read(),x=read();
	For(i,1,n)d[i]=read(),d[i]-=x,e[i].clear();
	For(i,2,n){
		int f=read();
		b[i]=read(),b[i]-=x;
		c[i]=read(),c[i]-=x;
		e[f].pb(i);
	}
	Rep(u,n,1){
		memset(f[u],0,sizeof f[u]);
		f[u][0]=f[u][4]=f[u][5]=1;
		f[u][1]=d[u];
		for(int v:e[u]){
			memset(g,0,sizeof g);
			g[0]=f[u][0]*f[v][1];
			g[1]=f[u][1]*f[v][1]-f[u][0]*f[v][0]*b[v]*c[v];
			g[2]=f[u][2]*f[v][1]+f[u][0]*f[v][3];
			g[3]=f[u][3]*f[v][1]+f[u][1]*f[v][3];
			g[3]-=b[v]*c[v]*(f[u][0]*f[v][2]+f[u][2]*f[v][0]);
			g[3]-=x*b[v]*f[u][5]*f[v][4];
			g[3]-=x*c[v]*f[u][4]*f[v][5];
			g[4]=f[u][4]*f[v][1]-f[u][0]*f[v][4]*b[v];
			g[5]=f[u][5]*f[v][1]-f[u][0]*f[v][5]*c[v];
			memcpy(f[u],g,sizeof f[u]);
//			cout<<"F:\n";
//			For(j,0,5)cout<<f[u][j].x<<" "; cout<<"\n";
		}
		f[u][3]+=f[u][0]*x;
	//	cout<<"u: "<<u<<"\n";
	//	For(j,0,5)cout<<f[u][j].x<<" "; cout<<"\n";
	}
	modint res=f[1][1]+f[1][3];
	cout<<res.x<<"\n";
}

signed main()
{
	int T=read();
	while(T--)work();
    return 0;
}
/*

*/