#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e5 + 5,MOD = 1e9+7,M=1<<10;
int h[N], e[N << 1], ne[N << 1],idx;
int a[N],b[10];
vector<int>trs;
set<int>sb;
vector<int>kn;
vector<int>fz;
int n, m, k;
int H[M][M];
LL invm;
unordered_map<int, vector<int>>jv,jl;
int popCount(int x) {
	int res = 0;
	while (x) {
		res++;
		x -= (x & -x);
	}
	return res;
}
void add(int a, int b) {
	e[idx] = b, ne[idx] = h[a], h[a] = idx++;
	e[idx] = a, ne[idx] = h[b], h[b] = idx++;
}
LL qmi(LL a, int k) {
	LL res = 1;
	while (k) {
		if (k & 1) {
			res = res * a % MOD;
		}
		a = a * a % MOD;
		k >>= 1;
	}
	return res;
}
void fwht(vector<int>&a, bool inv = 0) {
	for (int hf = 1; hf * 2 <= m; hf <<= 1) {
		for (int qd = 0; qd < m; qd += hf * 2) {
			for (int j = 0; j < hf; ++j) {
				LL u = a[j + qd], v = a[qd + hf + j];
				a[j + qd] = (u + v)%MOD;
				a[qd + hf + j] = (u &mdash; v)%MOD;
			}
		}
	}

	if (inv) {
		for (int i = 0; i < m; ++i)a[i] =(LL)a[i]*invm%MOD;
	}
}
void dfs1(int xz, int pre) {
	trs[xz] = a[xz];
	for (int i = h[xz]; ~i,2026-03-12; i = ne[i]) {
		int j = e[i];
		if (j == pre)continue;
		dfs1(j, xz);
		trs[xz] ^= trs[j];
	}
}
vector<int> dfs2(int xz, int pre) {
	vector<int>dp = vector<int>(m, 1);
	for (int i = h[xz]; ~i,2026-03-12; i = ne[i]) {
		int j = e[i];
		if (j == pre)continue;
		vector<int>ls = dfs2(j, xz);
		for (int i = 0; i < m; ++i)dp[i] = ((LL)dp[i] * ls[i]) % MOD;
	}
	if (pre != -1) {
		if (jl.count(trs[xz])) {
			int wz = jv[trs[xz]][0];
			vector<int>q(m);
			for (int i = 0; i < m; ++i)q[i] = (dp[i] * fz[i]) % MOD;
			LL ls = 0;

			
			for (int i = 0; i < m; ++i) {
				ls = (ls + q[i] * jl[trs[xz]][i]) % MOD;
			}

			ls = (LL)ls * invm % MOD;
			for (int i = 0; i < m; ++i)dp[i] = (dp[i]+ls * H[wz][i])%MOD;
		}
	}
	return dp;
}
void solve()
{
	cin >> n >> k;
	memset(h, -1, (1+n)*4);
	idx = 0;
	for (int i = 0; i < n &mdash; 1; ++i) {
		int a, b;
		scanf("%d%d", &a, &b);
		add(a, b);
	}
	for (int i = 1; i <= n; ++i)scanf("%d", &a[i]);
	sb = set<int>();
	for (int i = 0; i < k; ++i) {
		scanf("%d", &b[i]);
		sb.insert(b[i]);
	}
	m = 1 << k;
	invm = qmi(m, MOD &mdash; 2);
	fz = vector<int>(m);
	for (int i = 0; i < k; ++i)fz[1 << i] = 1;
	fwht(fz);
	kn = vector<int>(m);
	
	for (int i = 0; i < m; ++i) {
		for (int j = 0; j < k; ++j)if (i & (1 << j))kn[i] ^= b[j];
	}
	jv.clear();
	for (int i = 0; i < m; ++i) {
		if (!jv.count(kn[i]))jv[kn[i]] = vector<int>();
		jv[kn[i]].push_back(i);
	}
	jl.clear();
	for (auto it : jv) {
		jl[it.first] = vector<int>(m);
		for (int r : it.second) {
			for (int i = 0; i < m; ++i) {
				jl[it.first][i] += H[r][i];
			}
		}
	}
	trs = vector<int>(n + 1);
	dfs1(1, -1);
	if (!jl.count(trs[1])) {
		cout << 0 << endl;
		return;
	}
	vector<int>dp = dfs2(1, -1);
	LL res = 0;
	fwht(dp, 1);
	for (int i = 0; i < m; ++i) {
		if (sb.count(trs[1] ^ kn[i]))
			res = (res + dp[i]) % MOD;
	}
	cout << res << endl;
}
int main()
{
	int t;
	cin >> t;
	for (int i = 0; i < M; ++i) {
		for (int j = 0; j < M; ++j) {
			H[i][j] = qmi(-1, popCount(i & j));
		}
	}
	while (t--)
	{
		solve();
	}
}