#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
vector<int> G[100005];
long long a[100005], d[100005], n, m;
vector<long long> nums;
void dfs(int u, int f) {
  d[u] = 1;
  for (int i = 0; i < G[u].size(); ++i) {
    int x = G[u][i];
    if (x == f) continue;
    dfs(x, u);
    d[u] += d[x];
  }
}
void dfs2(int u, int f) {
  for (int i = 0; i < G[u].size(); ++i) {
    int x = G[u][i];
    if (x == f) continue;
    nums.push_back(d[x] * (n - d[x]));
    dfs2(x, u);
  }
}
int main() {
  int T;
  cin >> T;
  while (T--) {
    cin >> n;
    nums.clear();
    for (int i = 1; i <= n; ++i) G[i].clear();
    for (int i = 1, u, v; i < n; ++i)
      cin >> u >> v, G[u].push_back(v), G[v].push_back(u);
    cin >> m;
    for (int i = 0; i < m; ++i) cin >> a[i];
    sort(a, a + m);
    dfs(1, 0), dfs2(1, 0);
    sort(nums.begin(), nums.end());
    long long ans = 0;
    int j = 0;
    if (m > n - 1) {
      for (int i = n - 1; i < m; ++i) a[n - 2] = a[n - 2] * a[i] % mod;
      for (int i = 0; i < n - 1; ++i)
        ans = (ans + nums[i] % mod * a[i] % mod) % mod;
    } else {
      for (int i = 0; i < n - 1 - m; ++i) ans = (ans + nums[j++] % mod) % mod;
      for (int i = 0; i < m; ++i)
        ans = (ans + nums[j++] % mod * a[i] % mod) % mod;
    }
    cout << ans << endl;
  }
  return 0;
}
