#include <bits/stdc++.h>

using namespace std;

#define int long long

struct edge
{
  int to, cost;
};
int N, M, U[200];
vector< edge > g[200];

vector< int > rec(int idx, int par = -1)
{
  vector< int > dp(M + 1, 0);
  dp[0] = U[idx];
  for(auto e : g[idx]) {
    if(par == e.to) continue;
    vector< int > pp = rec(e.to, idx);
    for(int j = M; j >= 0; j--) {
      for(int k = M; k >= 0; k--) {
        int next = k + j + e.cost * 2;
        if(next > M) continue;
        dp[next] = max(dp[next], dp[j] + pp[k]);
      }
    }
  }
  return (dp);
}

signed main()
{
  cin >> N >> M;
  for(int i = 0; i < N; i++) {
    cin >> U[i];
  }
  for(int i = 0; i < N - 1; i++) {
    int A, B, C;
    cin >> A >> B >> C;
    g[A].push_back((edge) {B, C});
    g[B].push_back((edge) {A, C});
  }
  auto p = rec(0);
  cout << *max_element(begin(p), end(p)) << endl;
}