#include <bits/stdc++.h>
using namespace std;
int dfs(int i, vector<vector<int>>& edg, vector<int>& color,
        vector<long long int>& parts) {
  int n = edg[i].size();
  int sum = 0;
  int j;
  for (j = 0; j < n; j++) {
    if (color[edg[i][j]] == -1) {
      color[edg[i][j]] = 0;
      sum += dfs(edg[i][j], edg, color, parts);
    }
  }
  color[i] = 1;
  parts.push_back(sum + 1);
  return sum + 1;
}
int main() {
  int t;
  int n;
  int m;
  int ind1, ind2;
  cin >> t;
  int i, x, y;
  vector<long long int> parts;
  vector<long long int> primes;
  vector<long long int> prime;
  long long int product;
  vector<int> color;
  long long int ans = 0;
  long long int val, val1, val2;
  while (t > 0) {
    cin >> n;
    vector<vector<int>> edg(n + 1);
    parts.clear();
    color.clear();
    prime.clear();
    primes.clear();
    ans = 0;
    for (i = 1; i < n; i++) {
      cin >> x;
      cin >> y;
      edg[x].push_back(y);
      edg[y].push_back(x);
      color.push_back(-1);
    }
    color.push_back(-1);
    color.push_back(-1);
    color[1] = 0;
    dfs(1, edg, color, parts);
    sort(parts.begin(), parts.end());
    ind2 = upper_bound(parts.begin(), parts.end(), n / 2) - parts.begin();
    ind1 = ind2 - 1;
    cin >> m;
    for (i = 0; i < m; i++) {
      cin >> x;
      primes.push_back(x);
    }
    sort(primes.begin(), primes.end(), greater<int>());
    if (m > n - 1) {
      product = 1;
      for (i = 0; i < m - n + 2; i++) {
        product *= primes[i];
        product %= 1000000007;
      }
      prime.push_back(product);
      for (i = m - n + 2; i < m; i++) {
        prime.push_back(primes[i]);
      }
    } else {
      for (i = 0; i < m; i++) {
        prime.push_back(primes[i]);
      }
    }
    ans = 0;
    m = prime.size();
    for (i = 0; i < m; i++) {
      if (ind1 >= 0 && ind2 < n - 1) {
        val1 = parts[ind1];
        val1 *= (n - parts[ind1]);
        val2 = parts[ind2];
        val2 *= (n - parts[ind2]);
        val = max(val1, val2);
        if (val == val1) {
          ind1--;
        } else {
          ind2++;
        }
        val %= (1000000007);
      } else if (ind1 >= 0) {
        val1 = parts[ind1];
        val1 *= (n - parts[ind1]);
        val = val1;
        val %= (1000000007);
        ind1--;
      } else {
        val2 = parts[ind2];
        val2 *= (n - parts[ind2]);
        val = val2;
        val %= (1000000007);
        ind2++;
      }
      val *= prime[i];
      val %= (1000000007);
      ans += val;
      ans %= (1000000007);
    }
    while (ind1 >= 0) {
      val = parts[ind1];
      val *= (n - parts[ind1]);
      val %= (1000000007);
      ans += val;
      ans %= (1000000007);
      ind1--;
    }
    while (ind2 < n - 1) {
      val = parts[ind2];
      val *= (n - parts[ind2]);
      val %= (1000000007);
      ans += val;
      ans %= (1000000007);
      ind2++;
    }
    cout << ans << endl;
    edg.clear();
    t--;
  }
  return 0;
}
