#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > g[200100];
long long pr[200100];
long long cnt[200100];
long long ans = 0;
long long get(long long v) {
  while (pr[v] != v) {
    pr[v] = pr[pr[v]];
    v = pr[v];
  }
  return v;
}
void merge(long long a, long long b) {
  long long f = get(a), s = get(b);
  if (f != s) {
    ans -= (cnt[s] * (cnt[s] - 1) / 2);
    ans -= (cnt[f] * (cnt[f] - 1) / 2);
    pr[s] = f;
    cnt[f] += cnt[s];
    ans += (cnt[f] * (cnt[f] - 1) / 2);
  }
}
long long ans_a[200100];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, m;
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    pr[i] = i;
    cnt[i] = 1;
  }
  vector<pair<long long, pair<long long, long long> > > v;
  for (long long i = 1; i <= n - 1; i++) {
    long long a, b, w;
    cin >> a >> b >> w;
    g[a].push_back(make_pair(b, w));
    g[b].push_back(make_pair(a, w));
    v.push_back(make_pair(w, make_pair(a, b)));
  }
  vector<pair<long long, long long> > q;
  for (long long i = 1; i <= m; i++) {
    long long x;
    cin >> x;
    q.push_back(make_pair(x, i));
  }
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  sort(q.begin(), q.end());
  for (long long i = 0; i < q.size(); i++) {
    long long x = q[i].first;
    while (v.size() && v.back().first <= x) {
      long long f = v.back().second.first;
      long long s = v.back().second.second;
      merge(f, s);
      v.pop_back();
    }
    ans_a[q[i].second] = ans;
  }
  for (long long i = 1; i <= m; i++) {
    cout << ans_a[i] << " ";
  }
  cout << endl;
  return 0;
}
