#include using namespace std; #define int long long #define fi first #define se second #define pb push_back #define rep(i, s, n) for (int i = s; i < n; i++) #define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--) #define all(a) a.begin(),a.end() typedef pairpint; typedef vectorvint; typedef vectorvpint; const long long MOD = 1000000007, INF = 1e18; templateinline bool chmax(T& a,T b){if(ainline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;} string get_str(string s) { s+=','; string ret=""; for(int i=0; ivector make_v(size_t a){return vector(a);} template auto make_v(size_t a,Ts... ts){ return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value==0>::type fill_v(T &t,const V &v){t=v;} template typename enable_if::value!=0>::type fill_v(T &t,const V &v){ for(auto &e:t) fill_v(e,v); } int N,M; int u[202]; vpint g[2020]; int dp[303][3030]; void dfs(int now,int par){ rep(i,0,M+1)dp[now][i] = u[now]; for(auto e:g[now]){ if(e.fi==par)continue; dfs(e.fi,now); rrep(i,0,M+1){ rep(j,0,M+1){ if(i>N>>M; for(int i = 0;i < N;i++){ cin>>u[i]; } for(int i = 0;i < N-1;i++){ int a,b,c; cin>>a>>b>>c; g[a].push_back({b,c}); g[b].push_back({a,c}); } memset(dp,-1,sizeof(dp)); dfs(0,-1); int ans = 0; rep(i,0,M+1)chmax(ans,dp[0][i]); cout<