#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define ALL(x) (x).begin(), (x).end() #define BIT(n) (1LL<<(n)) #define SZ(x) ((int)(x).size()) #define fst first #define snd second typedef long long ll; typedef vector vi;typedef vector vvi;typedef pair pii;typedef vector vpii; void Main() { int N, M; scanf("%d%d", &N, &M); vi U(N); rep(i, N) scanf("%d", &U[i]); vector E(N); rep(i, N-1) { int u, v, w; scanf("%d%d%d", &u, &v, &w); E[u].emplace_back(v, w); E[v].emplace_back(u, w); } function dfs = [&](int cur, int pre) { //_p("dfs(%d,%d)\n", cur,pre); vector subs; forr(nex, E[cur]) { int nev = nex.fst; int nec = nex.snd; if (nev == pre) continue; vpii sub = dfs(nev, cur); forr(s, sub) { //_p("(%d,%d)\n", s.fst, s.snd); s.snd += nec * 2; } subs.push_back(sub); } /* _p("subz:%d\n", SZ(subs)); rep(i, SZ(subs)) { auto &sub = subs[i]; forr(s, sub) _p("%d:%d:(%d,%d)\n",cur,i,s.fst,s.snd); } */ vpii ret; function rec = [&](int i, int b, int c) { if (c > M) return; if (i == SZ(subs)) { ret.emplace_back(U[cur] + b, c); return; } rec(i+1, b, c); forr(s, subs[i]) { int bb = b + s.fst; int cc = c + s.snd; rec(i+1, bb, cc); } }; rec(0, 0, 0); //forr(s, ret) _p("%d: (%d,%d)\n",cur,s.fst,s.snd); return ret; }; vpii ret = dfs(0, -1); int ans = 0; forr(s, ret) { if (s.snd <= M) ans = max(ans, s.fst); } _p("%d\n", ans); } int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }