#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

const int MMAX = 2222;
const int NMAX = 222;
ll N, M;
ll dp[NMAX][MMAX][2]; // 頂点番号, 時間, 0は確定バージョン
ll U[NMAX];
bool visited[NMAX];
vector<vector<ll> > G(NMAX);
ll C[NMAX][NMAX]; // かかる時間

void dfs(int v){
  visited[v] = true;
  dp[v][0][0] = U[v];
  for(auto &to : G[v]){
    if(!visited[to]){
      dfs(to);
      // 一個後ろ
      FOR(i,0,M+1){
        if(dp[to][i][0] == 0) continue;
        // 今のところにたす
        FOR(j,0,M+1){
          if(dp[v][j][0] == 0) continue;
          if(j + i + 2 * C[v][to] > M) continue;
          dp[v][j + i + 2 * C[v][to]][1] = max(dp[v][j + i + 2 * C[v][to]][1], dp[v][j][0] + dp[to][i][0]);
        }
      }
      // 更新
      FOR(i,0,M+1){
        dp[v][i][0] = max(dp[v][i][0], dp[v][i][1]);
      }
    }
  }
  return;
}

int main(){
  cin >> N >> M;
  FOR(i,0,N) cin >> U[i];
  FOR(i,0,N-1){
    ll a, b, c;
    cin >> a >> b >> c;
    G[a].push_back(b);
    G[b].push_back(a);
    C[a][b] = c;
    C[b][a] = c;
  }
  FOR(i,0,NMAX) FOR(j,0,MMAX) FOR(k,0,2) dp[i][j][k] = 0;
  dfs(0);
  ll ans = 0;
  FOR(i,0,M+1){
    ans = max(ans, dp[0][i][0]);
  }
  printf("%lld\n", ans);
  return 0;
}