#include <bits/stdc++.h>
#define int long long

using namespace std;
using Pii = pair<int, int>;

const int kMaxN = 205, kMaxV = 2005;

int n, k, a[kMaxN], f[kMaxN][kMaxV];
vector<Pii> e[kMaxN];

void S(int x, int fa) {
  fill(f[x], f[x] + k + 1, a[x]);
  for (Pii p : e[x]) {
    int nxt = p.first, w = p.second;
    if (nxt != fa) {
      S(nxt, x);
      for (int i = k; i >= 2 * w; i--) {
        for (int k = 0; k <= i - 2 * w; k++) {
          f[x][i] = max(f[x][i], f[x][i - 2 * w - k] + f[nxt][k]);     
        }
      }
    }
  }
}
/*xbt ddddd*/
signed main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1, x, y, w; i < n; i++) {
    cin >> x >> y >> w, x++, y++;
    e[x].push_back({y, w}), e[y].push_back({x, w});
  }
  S(1, 0);
  cout << f[1][k];
}