#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 100'000 + 10;
int n;
int a[N];
vector<int> ad[N];

int d[N], f[N];
void dfs0(int u, int p = -1) { 
  for (const auto& v : ad[u]) { 
    if (v == p) continue;
    f[v] = d[v] = d[u] + 1;
    dfs0(v, u);
    f[u] = max(f[u], f[v]);
  }
}
vector<int> vt[N];
int totalSize[N];

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);
  
  int test; cin >> test;
  while (test--) {
    cin >> n;
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 1; i < n; ++i) { 
      int u, v; cin >> u >> v;
      ad[u].push_back(v);
      ad[v].push_back(u);
    }
    
    dfs0(1);
    for (int i = 1; i <= n; ++i) vt[f[i]].push_back(i);
    int maxDepth = f[1];

    int answer = 0;
    for (int i = maxDepth; i >= 0; --i) { 
      for (const auto& x : vt[i]) totalSize[d[x]] += 1;

      int ret = 1'000'000'000'000'000;
      for (int j = 0; j <= i; ++j) ret = min(ret, totalSize[j] * a[i - j]);
      answer += ret;
    }

    cout << answer << "\n";

    for (int i = 0; i <= maxDepth; ++i) {
      vt[i].clear();
      totalSize[i] = 0;
    }

    for (int i = 1; i <= n; ++i) { 
      ad[i].clear();
      d[i] = f[i] = 0;
    }
  }
}