#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>
#include <iomanip>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1

ll sq(ll num) { return num*num; }
ll mod_pow(ll x, ll n) {
	if (n == 0)return 1;
	if (n == 1)return x%MOD;
	ll res = sq(mod_pow(x, n / 2));
	res %= MOD;
	if (n % 2 == 1) {
		res *= x;
		res %= MOD;
	}
	return res;
}
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a*b % MOD; }

int n,m;
ll u[200];

ll dp[200][2000+1];

struct edge{
	ll to,cost;
	edge(ll _to,ll _cost):to(_to),cost(_cost){}
};


void update(int now,int to,int c){
	for(int i = 2000;i>=0;i--){
		rep(j,2001){
			if(i-c-j >= 0)dp[now][i] = max(dp[now][i-c-j]+dp[to][j],dp[now][i]);
		}
	}
}

vector<edge> G[200];
bool used[200];

void solve(int now){
	used[now] = true;
	rep(i,G[now].size()){
		ll to = G[now][i].to;
		if(used[to])continue;
		solve(to);
		update(now,to,G[now][i].cost);
	}
}

int main(){
	cin >> n >> m;
	rep(i,n)cin >> u[i];
	rep(i,n-1){
		ll a,b,c;
		cin >> a >> b >> c;
		G[a].push_back(edge(b,2*c));
		G[b].push_back(edge(a,2*c));
	}
	rep(i,200)rep(j,2000+1)dp[i][j] = -INF;
	rep(i,n)dp[i][0] = u[i];
	solve(0);
	ll ans = 0;
	rep(i,m+1)ans = max(ans,dp[0][i]);
	cout << ans << endl;
}