#include #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define each(x, y) for (auto &x : y) #define all(a) (a).begin(), (a).end() #define bit32(x) (1 << (x)) #define bit64(x) (1ll << (x)) using namespace std; using i32 = int; using i64 = long long; using u64 = unsigned long long; using f80 = long double; using vi32 = vector; using vi64 = vector; using vu64 = vector; using vf80 = vector; using vstr = vector; inline void yes() { cout << "Yes" << '\n'; exit(0); } inline void no() { cout << "No" << '\n'; exit(0); } inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); } inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; } inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); } template class pqasc : public priority_queue, greater> {}; template class pqdesc : public priority_queue, less> {}; template inline void amax(T &x, T y) { if (x < y) x = y; } template inline void amin(T &x, T y) { if (x > y) x = y; } template inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template inline T bis(T ok, T ng, function f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; } template istream& operator>>(istream &is, vector &v) { each(x, v) is >> x; return is; } template ostream& operator<<(ostream &os, vector &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } template struct WeightedGraph { struct Edge { int to; T cost; }; vector> edges; int n; WeightedGraph(int n) : n(n) { edges = vector>(n); } void add_edge(int from, int to, T cost = 0) { edges[from].push_back((Edge) { to, cost }); } vector& operator[](int x) { return edges[x]; } }; void solve() { int N, M; cin >> N >> M; vi32 U(N); cin >> U; WeightedGraph g(N); rep(i, N - 1) { int a, b, c; cin >> a >> b >> c; g.add_edge(a, b, c); g.add_edge(b, a, c); } vector> dp(N); function dfs = [&](int u, int p) { unordered_map mp; mp[0] = U[u]; each(e, g[u]) if (e.to != p) { dfs(e.to, u); auto dest = mp; each(p, mp) each(m, dp[e.to]) { int time = p.first + m.first + e.cost * 2; if (time > M) continue; amax(dest[time], m.second + p.second); } mp = dest; } dp[u] = mp; }; dfs(0, -1); i64 ans = 0; each(m, dp[0]) { amax(ans, m.second); } cout << ans << endl; }