#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

vector<pair<int,int>> e[200];
vector<int> ord;
int u[200], dp[200][2001], tmp[2001];
pair<int,int> par[200];
bool used[200];

void dfs(int v) {
    used[v] = true;
    for (auto p: e[v]) if (!used[p.first]) {
        dfs(p.first);
        par[p.first] = {v,p.second};
    }
    if (v != 0) ord.push_back(v);
}

int main(void) {
    int i, j, k, n, m;
    cin >> n >> m;
    m /= 2;
    REP (i,n) cin >> u[i];
    REP (i,n-1) {
        int a, b, c;
        cin >> a >> b >> c;
        e[a].push_back({b,c});
        e[b].push_back({a,c});
    }
    dfs(0);
    REP (i,n) REP (j,0,m) dp[i][j] = u[i];
    for (auto i: ord) {
        int x = par[i].first;
        int cost = par[i].second;
        REP (j,0,m) tmp[j] = 0; 
        REP (j,0,m-cost) RREP (k,m-j-cost,0) {
            tmp[k+j+cost] = max(tmp[k+j+cost],dp[x][k] + dp[i][j]);
        }
        REP (j,0,m) dp[x][j] = max(dp[x][j],tmp[j]);
    }
    cout << dp[0][m] << endl;
    return 0;
}