#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
struct edge{int v,w;};
int N,M,A[210],dp[210][2010],ans;
vector<edge>ne[210];
void dfs(int now,int fa){
    for(edge E:ne[now]){
        if(E.v == fa){continue;}
        dfs(E.v,now);
        for(int i = M;i >= E.w;--i){
            for(int j = i-E.w;j >= 0;--j){
                dp[now][i] = max(dp[now][i],dp[now][i-E.w-j]+dp[E.v][j]);
            }
        }
    }
    for(int i = 0;i <= M;++i){dp[now][i] += A[now];}
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    // freopen("tulip.in","r",stdin);
    // freopen("tulip.out","w",stdout);
    cin >> N >> M;
    for(int i = 0;i < N;++i){cin >> A[i];}
    for(int i = 1;i < N;++i){
        int u,v,w;cin >> u >> v >> w;
        ne[u].push_back({v,w*2});
        ne[v].push_back({u,w*2});
    }
    dfs(0,0);
    cout << dp[0][M] << "\n";
	return 0;
}