#include<bits/stdc++.h>
using namespace std;

#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define fi first
#define se second
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

struct edge{
    int to,cost;
    edge(int to,int cost):to(to),cost(cost){}
};

int N,M;
int U[200];
vector<edge>G[200];
int dp[200][2001];
void dfs(int v,int p){
    rep(i,M+1)dp[v][i]=U[v];
    for(auto e:G[v]){
        if(e.to==p)continue;
        dfs(e.to,v);
        for(int i=M;i-e.cost*2>=0;i--){
            for(int j=0;j+e.cost*2<=i;j++){
                chmax(dp[v][i],dp[v][i-j-e.cost*2]+dp[e.to][j]);
            }
        }
    }
}
signed main(){
    scanf("%lld%lld",&N,&M);
    rep(i,N)scanf("%lld",&U[i]);
    rep(i,N-1){
        int a,b,c;
        scanf("%lld%lld%lld",&a,&b,&c);
        G[a].pb(edge(b,c));
        G[b].pb(edge(a,c));
    }

    dfs(0,-1);
    printf("%lld\n",dp[0][M]);
    return 0;
}