#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll MOD = 1e9+7;

using P = pair<ll, ll>;
vector<P> G[210];
ll N, M;

void dfs(int v, int par, auto& dp, auto& U){
    dp[v][0] = U[v];
    for(auto& [nv, cost] : G[v]) {
        if(par == nv) continue;
        dfs(nv, v, dp, U);
        for(int m0 = M-1; m0 >= 0; m0--){
            for(int m1 = M-1; m1 >= 0; m1--){
                auto nm = m0 + m1 + 2*cost;
                if(nm <= M)
                    chmax(dp[v][nm], dp[v][m0] + dp[nv][m1]);
            }
        }
    }
}

int main(){
    cin >> N >> M;
    vector<ll> U(N);
    for(auto& u : U)
        cin >> u;
    REP(i,N-1){
        ll a, b, c;
        cin >> a >> b >> c;
        G[a].push_back(P(b, c));
        G[b].push_back(P(a, c));
    }
    
    vector<vector<ll>> dp(N, vector<ll>(M+1, 0));
    dfs(0, -1, dp, U);

    ll ans = 0;
    REP(m,M+1)
        chmax(ans, dp[0][m]);

    cout << ans << endl;
    return 0;
}