#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll INF = 1e18;
ll MOD = 1e9 + 7;

int N, M;
int U[1020];
ll dp[202][1020];
vector<P> E[202];

void dfs(int cur, int pre = -1){
    rep(i,0,M+1) dp[cur][i] = U[cur];

    fore(e,E[cur]) if(e.first != pre){
        int tar = e.first;
        int cost = e.second;
        dfs(tar, cur);

        rrep(i,M,0) rep(j,0,i-cost+1){
            dp[cur][i] = max(dp[cur][i], dp[cur][i-(j+cost)] + dp[tar][j]);
        }
    }
}

int main(){
    cin >> N >> M;
    M /= 2;

    rep(i,0,N) cin >> U[i];

    int x, y, r;
    rep(i,0,N-1){
        cin >> x >> y >> r;
        E[x].push_back({y,r});
        E[y].push_back({x,r});
    }
    
    dfs(0);

    cout << *max_element(dp[0], dp[0]+M+1) << endl;
}