#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,t;
ll v[252];
vi g[252];
int cost[252][252];

bool used[252];

vl dfs(int p){
  used[p] = true;
  vl ret(1001,0);
  ret[0] = v[p];
  REP(i,g[p].size()){
    int to = g[p][i];
    if(used[to])continue;
    vl add = dfs(to);
    int pl = cost[p][to];
    FORR(j,0,1000-pl+1)REP(k,1000-pl-j+1){
      CHMAX(ret[j+k+pl],ret[j]+add[k]);
    }
  }
  return ret;
}

int main(){
  scanf("%d%d",&n,&t);
  REP(i,n)scanf("%lld",v+i);
  REP(i,n-1){
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    g[a].push_back(b);
    g[b].push_back(a);
    cost[a][b] = cost[b][a] = c;
  }
  vl ans = dfs(0);
  ll mx = 0;
  t /= 2;
  REP(i,t+1)CHMAX(mx,ans[i]);
  printf("%lld\n",mx);
  return 0;
}