#include <bits/stdc++.h>
using namespace std;
vector<int64_t> parent;
int64_t getComponent(int64_t pos) {
  if (parent[pos] != pos) {
    parent[pos] = getComponent(parent[pos]);
  }
  return parent[pos];
}
signed main() {
  int64_t n, queries;
  cin >> n >> queries;
  parent.assign(n, -1);
  iota(parent.begin(), parent.end(), 0);
  vector<tuple<int64_t, int64_t, int64_t>> edges(n - 1);
  vector<int64_t> componentSize(n, 1);
  for (auto& [cost, start, end] : edges) {
    cin >> start >> end >> cost;
    start--;
    end--;
  }
  sort(edges.begin(), edges.end());
  map<int64_t, int64_t> results;
  auto numCombinations = [](int64_t n) { return n * (n - 1) / 2; };
  int64_t previousResult = 0;
  results[0] = 0;
  for (auto& [cost, start, end] : edges) {
    int64_t startSize = componentSize[getComponent(start)];
    int64_t endSize = componentSize[getComponent(end)];
    results[cost] = previousResult =
        previousResult - numCombinations(startSize) - numCombinations(endSize) +
        numCombinations(startSize + endSize);
    parent[getComponent(start)] = end;
    componentSize[getComponent(start)] = startSize + endSize;
  }
  for (int64_t t = 0; t < queries; t++) {
    int64_t q;
    cin >> q;
    cout << prev(results.upper_bound(q))->second << " ";
  }
  cout << endl;
}
