#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
template<C T>void pr(T a){cout<<a;ln;}
template<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
vector<P> v[200];
int d[2000001],a[200];

int dfs(int x, int p, int c) {
  rrep(i,2000001-c) d[i+c]=max(d[i+c],d[i]+a[x]);
  rep(i,v[x].size()) {
    int y=v[x][i].F;
    if(y!=p) dfs(y,x,v[x][i].S);
  }
}
void Main() {
  int n,m;
  cin >> n >> m;
  rep(i,n) cin >> a[i];
  rep(i,n-1) {
    int x,y,z;
    cin >> x >> y >> z;
    v[x].pb(P(y,z));
    v[y].pb(P(x,z));
  }
  dfs(0,-1,0);
  int ans=0;
  rep(i,2000001) {
    if(i*2<=m) ans=max(ans,d[i]);
  }
  pr(ans);
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}