#include <bits/stdc++.h>
using namespace std;
vector<long long int> P(200005);
vector<long long int> R(200005);
long long int get(long long int x) {
  if (P[x] != x) return P[x] = get(P[x]);
  return P[x];
}
long long int res;
long long int solve(long long int x) { return (x * (x - 1)) / 2; }
void merge(long long int x, long long int y) {
  long long int u = get(x);
  long long int v = get(y);
  if (R[u] < R[v]) swap(u, v);
  res -= solve(R[u]);
  res -= solve(R[v]);
  R[u] += R[v];
  res += solve(R[u]);
  P[v] = u;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  res = 0;
  long long int n, m;
  cin >> n >> m;
  for (long long int i = 0; i < n; i++) P[i] = i, R[i] = 1;
  vector<pair<long long int, pair<long long int, long long int>>> E(n - 1);
  for (long long int i = 0; i < n - 1; i++) {
    long long int u, v, w;
    cin >> u >> v >> w;
    E[i] = {w, {--u, --v}};
  }
  vector<pair<long long int, long long int>> Q(m);
  for (long long int i = 0; i < m; i++) cin >> Q[i].first, Q[i].second = i;
  sort(E.begin(), E.end());
  sort(Q.begin(), Q.end());
  long long int pos = 0;
  vector<long long int> Sol(m);
  for (long long int i = 0; i < m; i++) {
    while (pos < n - 1 && E[pos].first <= Q[i].first) {
      long long int u = E[pos].second.first;
      long long int v = E[pos].second.second;
      merge(u, v);
      pos++;
    }
    Sol[Q[i].second] = res;
  }
  for (long long int i = 0; i < m; i++) cout << Sol[i] << " ";
  cout << endl;
}
