#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
long long p[MAXN], sz[MAXN];
long long res;
int find(int x) {
  if (x == p[x]) return x;
  return p[x] = find(p[x]);
}
void join(int x, int y) {
  x = find(x);
  y = find(y);
  if (x != y) {
    res += sz[x] * sz[y];
    sz[x] += sz[y];
    p[y] = x;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 0, ThxDem = n; i < ThxDem; ++i) sz[i] = 1, p[i] = i;
  vector<pair<long long, pair<int, int>>> v(n - 1);
  for (int i = 0, ThxDem = n - 1; i < ThxDem; ++i)
    cin >> v[i].second.first >> v[i].second.second >> v[i].first;
  for (int i = 0, ThxDem = n - 1; i < ThxDem; ++i)
    v[i].second.first--, v[i].second.second--;
  vector<pair<int, int>> qs(m);
  vector<long long> ans(m);
  for (int i = 0, ThxDem = m; i < ThxDem; ++i)
    cin >> qs[i].first, qs[i].second = i;
  sort(v.begin(), v.end());
  sort(qs.begin(), qs.end());
  int pos = 0;
  for (int i = 0, ThxDem = m; i < ThxDem; ++i) {
    while (pos < int(v.size()) && v[pos].first <= qs[i].first) {
      join(v[pos].second.second, v[pos].second.first);
      pos++;
    }
    ans[qs[i].second] = res;
  }
  for (int i = 0, ThxDem = m; i < ThxDem; ++i) cout << ans[i] << " ";
  cout << "\n";
}
