// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 3e3, mod = 998244353;
int T, a, b, f[N + 5][N + 5], dep[N + 5], ans, s[N + 5], c[N + 5], rt;
vi st[N + 5], sq[N + 5], bel[N + 5];

int Dfs(int n, int fa, int x, int y) {
	int res = 1;
	for(int v : st[n]) if(v != fa) {
		if(s[v] == x) {
			dep[v] = dep[n] + 1;
			(res *= Dfs(v, n, x, y)) %= mod;
		}
		else if(s[v] != y) {
			// if(s[v] == 2) cout << n << ' ' << dep[n] << endl;
			if(x < s[v]) (res *= (dep[n] ? f[s[v]][dep[n] - 1] : 0) + f[s[v]][dep[n]]) %= mod;
			else (res *= f[s[v]][dep[n]] + f[s[v]][dep[n] + 1]) %= mod;
		}
		else rt = n;
	}
	return res;
}

void dfs(int n, int fa) {
	for(int v : sq[n]) if(v != fa) dfs(v, n);
	for(int x : bel[n]) {
		dep[x] = 0;
		int res = Dfs(x, 0, n, fa);
		if(n != 1) (f[n][dep[rt]] += res) %= mod;
		else (ans += res) %= mod;
	}
	// per(i, a, 0) (f[n][i] += f[n][i + 1]) %= mod;
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	for(cin >> T; T--; ) {
		ans = 0;
		cin >> a >> b;
		rep(i, 1, a) st[i].clear();
		rep(i, 1, b) sq[i].clear(), bel[i].clear(), c[i] = 0;
		rep(i, 1, b) rep(j, 0, a) f[i][j] = 0;
		int x, y;
		rep(i, 1, a - 1) {
			cin >> x >> y;
			st[x].PB(y), st[y].PB(x);
		}
		rep(i, 1, a) cin >> s[i], ++c[s[i]], bel[s[i]].PB(i);
		rep(i, 1, a) for(int v : st[i]) if(v > i && s[v] == s[i]) --c[s[i]];
		bool is = 1;
		rep(i, 1, b) is &= c[i] == 1;
		if(!is) {
			cout << "0\n";
			continue;
		}
		rep(i, 1, a) for(int v : st[i]) if(s[v] != s[i]) sq[s[i]].PB(s[v]);
		dfs(1, 0);
		// cout << f[2][0] << endl;
		cout << ans << '\n';
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}