#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<int, ll>;
int N, M;
vector<ll> U;
vector<P> G[210];

void dfs(int v, int p, vector<vector<ll>>& dp){
    REP(m, M+1) dp[v][m] = U[v];
    for(auto& [nv, c] : G[v]){
        if(nv == p) continue;
        dfs(nv, v, dp);
        for(int m0 = M; m0 >= 0; m0--){
            for(int m1 = M; m1 >= 0; m1--){
                if(m0 + m1 + 2*c <= M)
                    chmax(dp[v][m0 + m1 + 2*c], dp[v][m0] + dp[nv][m1]);
            }
        }
    }
}

int main(){
    cin >> N >> M;
    U.resize(N);
    for(auto& u : U) cin >> u;
    REP(i,N-1){
        ll a, b, c;
        cin >> a >> b >> c;
        G[a].emplace_back(b, c);
        G[b].emplace_back(a, c);
    }

    vector<vector<ll>> dp(N, vector<ll>(M+1));
    dfs(0, -1, dp);

    ll ans = 0;
    REP(m,M+1) chmax(ans, dp[0][m]);
    cout << ans << endl;
    return 0;
}