#include <bits/stdc++.h>
using namespace std;
template <typename T>
void input(vector<T> &arr, long long int n) {
  T temp;
  for (long long int i = 0; i < n; i++) cin >> temp, arr.push_back(temp);
}
template <typename T>
void output(vector<T> arr) {
  for (auto x : arr) cout << x << " ";
  cout << endl;
}
template <typename T>
void input_set(set<T> &arr, long long int n) {
  T temp;
  for (long long int i = 0; i < n; i++) cin >> temp, arr.insert(temp);
}
long long int mul(long long int a, long long int b) {
  return (a % 1000000007 * b % 1000000007) % 1000000007;
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b & 1) ans = mul(ans, a);
    a = mul(a, a);
    ;
    b >>= 1;
  }
  return ans;
}
vector<vector<int> > adj;
vector<long long int> muls;
vector<bool> visited;
long long int n;
int dfs(int src) {
  long long int nodes = 1;
  visited[src] = true;
  for (auto v : adj[src]) {
    if (visited[v]) continue;
    nodes += dfs(v);
  }
  muls.push_back((n - nodes) * (nodes));
  return nodes;
}
void solve() {
  int u, v, m;
  cin >> n;
  adj.clear();
  adj.resize(n);
  visited.clear();
  visited.resize(n, false);
  muls.clear();
  vector<long long int> p;
  for (int i = 0; i < n - 1; i++) {
    cin >> u >> v;
    --u;
    --v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  cin >> m;
  input(p, m);
  int sz = p.size();
  while (sz < n - 1) {
    p.push_back(1);
    sz++;
  }
  sort(p.begin(), p.end());
  while (sz > n - 1) {
    int nn = p.size();
    long long int ele = mul(p[sz - 1], p[sz - 2]);
    p.pop_back();
    p.pop_back();
    p.push_back(ele);
    --sz;
  }
  long long int ans = 0;
  dfs(0);
  sort(muls.begin(), muls.end());
  muls.erase(muls.begin());
  for (int i = 0; i < n - 1; i++)
    ans = (ans % 1000000007 + mul(p[i], muls[i]) % 1000000007) % 1000000007;
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int testcases;
  cin >> testcases;
  while (testcases--) {
    solve();
  }
}
