//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

struct edge{int to, cost;};
vector<edge> g[205];
int u[205];
int n, m;
ll dp[205][2010];
void dfs(int v, int p) {
  dp[v][0] = u[v];
  for(auto i: g[v]) {
    if(i.to == p) continue;
    dfs(i.to, v);
    for(int j=m; j>=0; --j) REP(k, m+1) {
      int t = j+i.cost*2+k;
      if(t <= m) chmax(dp[v][t], dp[v][j] + dp[i.to][k]);
    }
  }
}


signed main(void)
{
  cin >> n >> m;
  REP(i, n) cin >> u[i];
  REP(i, n-1) {
    int a, b, c;
    cin >> a >> b >> c;
    g[a].PB({b, c});
    g[b].PB({a, c});
  }

  dfs(0, -1);

  ll ans = 0;
  REP(i, m+1) chmax(ans, dp[0][i]);
  cout << ans << endl;

  return 0;
}