#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)



#define rrep(i,a,b) for(int i=a;i>=b;i--)
typedef long long ll;
int N, M;
int U[200];
vector<pair<int,int> > E[200];
//-----------------------------------------------------------------
ll dp[200][2001];
void dfs(int i, int par) {
	dp[i][0] = U[i];

	for (auto p : E[i]) if (p.first != par) {
		dfs(p.first, i);

		int j = p.first;
		int c = p.second;

		rrep(ii, M, 0) rep(jj, 0, M + 1) {
			int t = ii + c * 2 + jj;
			if(t <= M) dp[i][t] = max(dp[i][t], dp[i][ii] + dp[j][jj]);
		}
	}
}
//-----------------------------------------------------------------
int main() {
	cin >> N >> M;
	rep(i, 0, N) cin >> U[i];
	rep(i, 0, N - 1) {
		int A, B, C;
		cin >> A >> B >> C;
		E[A].push_back(make_pair(B, C));
		E[B].push_back(make_pair(A, C));
	}

	dfs(0, -1);

	ll ans = 0;
	rep(i, 0, M + 1) ans = max(ans, dp[0][i]);
	cout << ans << endl;
}