#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  x = max(x, y);
}
template <typename T>
void chkmin(T &x, const T &y) {
  x = min(x, y);
}
constexpr int MOD = 1e9 + 7;
void dec(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
int qpow(int x, int y) {
  int ret = 1;
  for (; y; y >>= 1, x = (ll)x * x % MOD)
    if (y & 1) ret = (ll)ret * x % MOD;
  return ret;
}
constexpr int MAXN = 1e5 + 10;
int n, k, deg[MAXN], fac[MAXN], ifac[MAXN], inv[MAXN];
int dp[MAXN], res;
bool imp[MAXN], vis[MAXN];
pair<int, int> edg[MAXN];
vector<int> g[MAXN];
void dfs(int u, int pre) {
  vis[u] = true;
  dp[u] = (deg[u] == 1);
  for (auto v : g[u]) {
    if (v == pre) continue;
    dfs(v, u);
    res = (res + (ll)dp[u] * dp[v]) % MOD;
    dp[u] = (dp[u] + (ll)dp[v] * inv[max(deg[u] - 1, 0)]) % MOD;
  }
}
int calc(int u) {
  res = 0;
  dfs(u, 0);
  return res;
}
int main() {
  freopen("traverse.in", "r", stdin);
  freopen("traverse.out", "w", stdout);
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  fac[0] = 1;
  for (int i = 1; i < MAXN; ++i) fac[i] = (ll)fac[i - 1] * i % MOD;
  ifac[MAXN - 1] = qpow(fac[MAXN - 1], MOD - 2);
  for (int i = MAXN - 2; i >= 0; --i) ifac[i] = (ll)ifac[i + 1] * (i + 1) % MOD;
  for (int i = 1; i < MAXN; ++i) inv[i] = (ll)ifac[i] * fac[i - 1] % MOD;
  int cas, sid;
  cin >> sid >> cas;
  while (cas--) {
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) {
      g[i].clear();
      deg[i] = 0;
    }
    for (int i = 1, u, v; i < n; ++i) {
      cin >> u >> v;
      edg[i] = {u, v};
      imp[i] = false;
      g[u].emplace_back(v);
      g[v].emplace_back(u);
      ++deg[u];
      ++deg[v];
    }
    for (int i = 1, x; i <= k; ++i) {
      cin >> x;
      imp[x] = true;
    }
    int ans = calc(1);
    for (int i = 1; i <= n; ++i) {
      g[i].clear();
      vis[i] = false;
    }
    for (int i = 1, u, v; i < n; ++i) {
      if (!imp[i]) {
        tie(u, v) = edg[i];
        g[u].emplace_back(v);
        g[v].emplace_back(u);
      }
    }
    for (int i = 1; i <= n; ++i)
      if (!vis[i]) dec(ans, calc(i));
    for (int i = 1; i <= n; ++i) ans = (ll)ans * fac[deg[i] - 1] % MOD;
    cout << ans << "\n";
  }
  return 0;
}
/*
g++ traverse.cpp -o traverse -O2 -std=c++14 -Wall -Wextra -Wshadow -g -fsanitize=address,undefined
*/