# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// # define int long long 
# define lc u << 1
# define rc u << 1 | 1
# define fi first
# define se second
# define endl "\n"
const int N = 205, M = 2005;

int n, m;
int a[N];
vector <pair <int, int>> e[N];
int f[N][M];
void dfs (int u, int fa)
{
	for (int i = 0; i <= m; i ++ )
		f[u][i] = a[u];
	for (auto [v, w] : e[u])
	{
		if (v == fa) continue;
		dfs (v, u);
		for (int i = m / 2 * 2; i >= w * 2; i -= 2)
		{
			for (int j = 0; j <= i - 2 * w; j += 2)
				f[u][i] = max (f[u][i], f[u][i - j - 2 * w] + f[v][j]);
		}
	}
}
signed main ()
{
    // freopen ("tulip.in", "r", stdin); freopen ("tulip.out", "w", stdout);
    ios::sync_with_stdio (0); cin.tie (0); cout.tie (0);
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ )
    	cin >> a[i];
    for (int i = 1; i < n; i ++ )
    {
    	int u, v, w; cin >> u >> v >> w;
    	u ++ , v ++ ;
    	e[u].push_back ({v, w}), e[v].push_back ({u, w});
    }
	dfs (1, 0);
	int ans = 0;
	for (int i = 0; i <= m; i ++ )
		ans = max (ans, f[1][i]);
	cout << ans << endl;
	return 0;
}