#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


int N, K;
vector<int> A, B;
vector<int> F;

vector<vector<int>> graph;
vector<vector<int>> uss;

int dist[3010][3010];
void dfsDist(int s, int u, int p) {
  for (const int v : graph[u]) if (p != v) {
    dist[s][v] = dist[s][u] + 1;
    dfsDist(s, v, u);
  }
}

vector<vector<int>> GRAPH;
bitset<3010> can[3010];
vector<Mint> dp;

void solve(int k) {
  for (const int l : GRAPH[k]) {
    solve(l);
    for (const int u : uss[k]) {
      Mint sum = 0;
      for (const int v : uss[l]) if (can[u][v]) {
        sum += dp[v];
      }
      dp[u] *= sum;
    }
  }
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &N, &K);
    A.resize(N - 1);
    B.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    F.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &F[u]);
      --F[u];
    }
    
    graph.assign(N, {});
    for (int i = 0; i < N - 1; ++i) {
      graph[A[i]].push_back(B[i]);
      graph[B[i]].push_back(A[i]);
    }
    
    uss.assign(K, {});
    for (int u = 0; u < N; ++u) uss[F[u]].push_back(u);
    
    uf.assign(N, -1);
    for (int i = 0; i < N - 1; ++i) if (F[A[i]] == F[B[i]]) connect(A[i], B[i]);
    bool ok = true;
    for (int k = 0; k < K; ++k) {
      ok = ok && uss[k].size();
      for (const int u : uss[k]) ok = ok && (root(uss[k][0]) == root(u));
    }
    Mint ans = 0;
    if (ok) {
      for (int s = 0; s < N; ++s) {
        dist[s][s] = 0;
        dfsDist(s, s, -1);
      }
      const int k0 = 0;
      const int rt = uss[k0][0];
      GRAPH.assign(K, {});
      for (int u = 0; u < N; ++u) can[u].reset();
      for (int i = 0; i < N - 1; ++i) if (F[A[i]] != F[B[i]]) {
        int a = A[i], b = B[i];
        if (dist[rt][a] > dist[rt][b]) swap(a, b);
        GRAPH[F[a]].push_back(F[b]);
        for (const int u : uss[F[a]]) for (const int v : uss[F[b]]) {
          can[u][v] = (dist[a][u] == dist[b][v] || dist[a][u] == dist[b][v] + ((F[a] < F[b]) ? +1 : -1));
// if(can[u][v])cerr<<F[a]<<" "<<F[b]<<": "<<u<<" "<<v<<endl;
        }
      }
      dp.assign(N, 1);
      solve(k0);
      for (const int u : uss[k0]) {
        ans += dp[u];
      }
    }
    
    printf("%u\n", ans.x);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}