#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }


vector<int> t_parent;
vi t_ord;

void tree_getorder(const vector<vi> &g, int root) {
	int n = g.size();
	t_parent.assign(n, -1);
	t_ord.clear();

	vector<int> stk; stk.push_back(root);
	while(!stk.empty()) {
		int i = stk.back(); stk.pop_back();
		t_ord.push_back(i);
		for(int j = (int)g[i].size() - 1; j >= 0; j --) {
			int c = g[i][j];
			if(t_parent[c] == -1 && c != root)
				stk.push_back(c);
			else
				t_parent[i] = c;
		}
	}
}

int main() {
	int N; int M;
	while(~scanf("%d%d", &N, &M)) {
		vector<int> U(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &U[i]);
		vector<vector<int> > g(N);
		vector<vector<pair<int, int> > > gw(N);
		for(int i = 0; i < N - 1; ++ i) {
			int u, v, w;
			scanf("%d%d%d", &u, &v, &w);
			g[u].push_back(v);
			g[v].push_back(u);
			gw[u].push_back(make_pair(v, w));
			gw[v].push_back(make_pair(u, w));
		}
		tree_getorder(g, 0);
		vector<vector<ll>> memo(N, vector<ll>(M+1, -1));
		function<ll(int, int, int)> rec = [&](int i, int j, int m) -> ll {
			if(g[i].size() == j)
				return 0;
			int c = g[i][j];
			if(c == t_parent[i])
				return rec(i, j + 1, m);
			int w = gw[i][j].second;
			ll &r = memo[c][m];
			if(r != -1) return r;
			r = 0;
			rer(cm, 0, m - w * 2)
				amax(r, U[c] + rec(c, 0, cm) + rec(i, j + 1, m - w * 2 - cm));
			amax(r, rec(i, j + 1, m));
			return r;
		};
		ll ans = U[0] + rec(0, 0, M);
		printf("%lld\n", ans);
	}
	return 0;
}