#include <bits/stdc++.h>
#define ll long long
#define INF (1LL << 60)
#define MOD 1000000007
#define EPS 1e-10
#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 srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 105;

struct edge {
    int to, cost;
};

vector<edge> G[MAX_N];
int val[MAX_N], hc[MAX_N], cs[MAX_N];
ll ans;
int n, W;

int pre_dfs(int u, int p){
    int ret = 1, mx = 0;
    for(const edge& e : G[u]){
        if(e.to != p){
            int res = pre_dfs(e.to, u);
            cs[e.to] = e.cost;
            if(res > mx) mx = res, hc[u] = e.to;
            ret += res;
        }
    }
    return ret;
}

void dfs2(int u, int p, vector<ll>& dp){
    vector<ll> dp2(W+1, -INF);
    for(int i = cs[u]; i <= W; ++i){
        dp2[i] = dp[i-cs[u]] + val[u];
    }
    for(const edge& e : G[u]){
        if(e.to == p) continue;
        dfs2(e.to, u, dp2);
    }
    rep(i,W+1) dp[i] = max(dp[i], dp2[i]);
}

void dfs(int u, int p, const vector<ll>& dp, bool heavy){
    vector<ll> dp2(W+1, -INF);
    for(int i = cs[u]; i <= W; ++i){
        dp2[i] = dp[i-cs[u]] + val[u];
    }
    dp2[0] = val[u];
    for(const edge& e : G[u]){
        if(e.to == p || e.to == hc[u]) continue;
        dfs(e.to, u, dp2, false);
        dfs2(e.to, u, dp2);
    }
    rep(i,W+1) ans = max(ans, dp2[i]);
    if(hc[u] >= 0) dfs(hc[u], u, dp2, true);
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> W;
    rep(i,n){
        cin >> val[i];
        hc[i] = -1;
    }
    rep(i,n-1){
        int u, v, c;
        cin >> u >> v >> c;
        --u, --v;
        G[u].pb((edge){v, c}), G[v].pb((edge){u, c});
    }
    pre_dfs(0, -1);
    cs[0] = W+1;
    vector<ll> dp(W+1, -INF);
    dfs(0, -1, dp, false);
    cout << ans << "\n";
    return 0;
}



Measured memory_bytes: 62376