#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int MOD = 1000000007;
int T;
int n, m;
struct Edge {
  int to, next;
} edge[N << 1];
int head[N], cnt;
void add_edge(int u, int v) {
  cnt++;
  edge[cnt].to = v;
  edge[cnt].next = head[u];
  head[u] = cnt;
  return;
}
int siz[N];
long long val[N];
void dfs(int u, int father) {
  siz[u] = 1;
  for (int i = head[u]; i; i = edge[i].next) {
    int v = edge[i].to;
    if (v == father) continue;
    dfs(v, u);
    siz[u] += siz[v];
  }
  return;
}
void solve() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add_edge(x, y);
    add_edge(y, x);
  }
  dfs(1, 0);
  scanf("%d", &m);
  vector<int> p;
  for (int i = 1; i <= m; i++) {
    int x;
    scanf("%d", &x);
    p.push_back(x);
  }
  sort(p.begin(), p.end());
  while (p.size() > n - 1) {
    int m1 = p[p.size() - 2], m2 = p[p.size() - 1];
    p.pop_back(), p.pop_back();
    p.push_back(1LL * m1 * m2 % MOD);
  }
  reverse(p.begin(), p.end());
  while (p.size() < n - 1) p.push_back(1);
  for (int i = 2; i <= n; i++) val[i] = 1LL * siz[i] * (n - siz[i]);
  sort(val + 2, val + n + 1, greater<long long>());
  long long ans = 0;
  for (int i = 2; i <= n; i++)
    ans = (ans + val[i] % MOD * p[i - 2] % MOD) % MOD;
  printf("%lld\n", ans);
  for (int i = 1; i <= n; i++) head[i] = 0;
  cnt = 0;
  return;
}
int main() {
  scanf("%d", &T);
  while (T--) solve();
  return 0;
}
