#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 1e6 + 5, P = 1e9 + 7;

int n;
LL v, x[N], y[N], z[N];
int fa[N], la[N], ne[N], en[N], idx;
LL f[N][3][4], g[3][4];

inline void Add(int a, int b)
{
    ne[ ++ idx] = la[a];
    la[a] = idx;
    en[idx] = b;
}
inline void DP(int u)
{
    memset(f[u], 0, sizeof f[u]);
    f[u][0][3] = 1;
    f[u][1][2] = 1;
    f[u][1][1] = 1;
    f[u][2][0] = 1;
    f[u][0][0] = x[u];
    for(int i = la[u]; i; i = ne[i])
    {
        int v = en[i];
        memset(g, 0, sizeof g);
        for(int i = 0; i < 3; i ++ )
            for(int j = 0; j <= i; j ++ )
                for(int k = 0; k < 4; k ++ )
                    for(int l = 0; l <= k; l ++ )
                        if((l & k) == l)
                        {
                            LL s = f[u][i - j][k] * f[v][j][l];
                            if(l & 1) s = s % P * y[v];
                            if(l & 2) s = s % P * z[v];
                            g[i][k ^ l] = (g[i][k ^ l] + s) % P;
                        }
        memcpy(f[u], g, sizeof g);
        // printf("**%d %d\n", u, v);
        // printf("#%lld %lld %lld %lld\n", f[u][0][0], f[u][0][1], f[u][0][2], f[u][0][3]);
        // printf("#%lld %lld %lld %lld\n", f[u][1][0], f[u][1][1], f[u][1][2], f[u][1][3]);
        // printf("#%lld %lld %lld %lld\n", f[u][2][0], f[u][2][1], f[u][2][2], f[u][2][3]);
    }
    swap(f[u][0][1], f[u][0][2]);
    swap(f[u][1][1], f[u][1][2]);
    swap(f[u][2][1], f[u][2][2]);
    f[u][0][0] = P - f[u][0][0];
    f[u][1][0] = P - f[u][1][0];
    f[u][2][0] = P - f[u][2][0];
    // printf("**%d\n", u);
    // printf("#%lld %lld %lld %lld\n", f[u][0][0] - P, f[u][0][1], f[u][0][2], f[u][0][3]);
    // printf("#%lld %lld %lld %lld\n", f[u][1][0] - P, f[u][1][1], f[u][1][2], f[u][1][3]);
    // printf("#%lld %lld %lld %lld\n", f[u][2][0] - P, f[u][2][1], f[u][2][2], f[u][2][3]);
}

inline void Work()
{
    scanf("%d%lld", &n, &v);
    for(int i = 1; i <= n; i ++ ) la[i] = 0;
    idx = 0;
    for(int i = 1; i <= n; i ++ )
    {
        scanf("%lld", &x[i]);
        x[i] = (x[i] - v + P) % P;
    }
    for(int i = 2; i <= n; i ++ )
    {
        scanf("%d%lld%lld", &fa[i], &y[i], &z[i]);
        Add(fa[i], i);
        y[i] = (y[i] - v + P) % P;
        z[i] = (z[i] - v + P) % P;
    }
    for(int i = n; i >= 1; i -- ) DP(i);
    LL ans = (f[1][0][0] + f[1][2][0] * v) % P;
    if(n & 1) ans = (P - ans) % P;
    printf("%lld\n", ans);
}

int main()
{
    int T;
    scanf("%d", &T);
    while(T -- ) Work();
    return 0;
}