#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = 100010;
const int MX = 123456;
const int mod = (int)1e9 + 7;
const int base = 97;
const unsigned long long BS1 = 10000019ULL;
const int INF = (1 << 29);
template <class T>
inline void fastScan(T &x) {
  register char c = getchar();
  int neg = 0;
  x = 0;
  for (; (c < 48 || c > 57) && (c != '-'); c = getchar())
    ;
  if (c == '-') {
    neg = 1;
    c = getchar();
  }
  for (; c > 47 && c < 58; c = getchar()) {
    x = (x << 1) + (x << 3) + c - 48;
  }
  if (neg) x = -x;
}
int n, m;
int inp[N];
int dp[N];
vector<int> g[N], vec;
vector<long long> edges;
void dfs(int u, int par) {
  dp[u] = 1;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (v != par) {
      dfs(v, u);
      dp[u] += dp[v];
      int x = dp[v], y = n - dp[v];
      edges.push_back(1ll * x * y);
    }
  }
}
int Solve() {
  dfs(1, -1);
  for (int i = 1; i <= m; i++) {
    vec.push_back(inp[i]);
  }
  while (vec.size() < (n - 1)) {
    vec.push_back(1);
  }
  sort(vec.rbegin(), vec.rend());
  sort(edges.rbegin(), edges.rend());
  int ans = 0;
  long long c, d;
  while (edges.size() > 1) {
    c = edges.back();
    d = vec.back();
    edges.pop_back();
    vec.pop_back();
    ans = (ans + 1ll * c * d % mod) % mod;
  }
  c = edges[0];
  d = 1;
  while (vec.size() > 0) {
    d = 1ll * d * vec.back() % mod;
    vec.pop_back();
  }
  ans = ans + c * d % mod;
  ans %= mod;
  return ans;
}
int main() {
  int test;
  fastScan(test);
  while (test--) {
    fastScan(n);
    for (int i = 1; i <= n; i++) {
      dp[i] = 0;
      g[i].clear();
    }
    vec.clear();
    edges.clear();
    for (int i = 1; i < n; i++) {
      int u, v;
      fastScan(u);
      fastScan(v);
      g[u].push_back(v);
      g[v].push_back(u);
    }
    fastScan(m);
    for (int i = 1; i <= m; i++) {
      fastScan(inp[i]);
    }
    printf("%d\n", Solve());
  }
  return 0;
}
