#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=2e9+1;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
ll n,m;
vvpl g(210);
vl vals(210);
vl tim(210);
void dfs(ll v,ll par=-1){
  for(auto p:g[v]){
    if(p.first==par)continue;
    tim[p.first]=p.second;
    dfs(p.first,v);
  }
}
vvl dp(210);
vl conv(vl a,vl b){
  vl c(a.size()+b.size()-1);
  rep(i,a.size()){
    rep(j,b.size()){
      chmax(c[i+j],a[i]+b[j]);
    }
  }
  return c;
}
void dps(ll v,ll par=-1){
  dp[v].emplace_back(0);
  for(auto p:g[v]){
    if(p.first==par)continue;
    dps(p.first,v);
    dp[v]=conv(dp[v],dp[p.first]);
  }
  rep(i,tim[v]){
    dp[v].emplace_back(0);
    if(dp[v].size()>m)break;
  }
  per(i,dp[v].size()){
    if(i-tim[v]>=0)dp[v][i]=dp[v][i-tim[v]]+vals[v];
    else dp[v][i]=0;
  }
  //cout <<v << endl;
  //for(auto p:dp[v])cout << p <<" ";cout << endl;
}
int main(){
  cin >> n >> m;m/=2;
  rep(i,n)cin >> vals[i];
  rep(i,n-1){
    ll a,b,c;cin >>a  >> b >> c;
    g[a].push_back({b,c});
    g[b].push_back({a,c});
  }
  dfs(0);
  dps(0);
  cout << *max_element(all(dp[0])) << endl;
}