#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint;

void dfs(vector<vector<pii>> &graph, vector<bool> &isvisited, int v,
         vector<vector<ll>> &treedp, vector<ll> &U) {
    int N = graph.size();
    int limit = treedp[0].size() - 1;
    treedp[v][0] = U[v];
    isvisited[v] = true;
    for (int i = 0; i < graph[v].size(); i++) {
        int x = graph[v][i].first;
        int cost = graph[v][i].second;
        if (isvisited[x]) {
            continue;
        }
        dfs(graph, isvisited, x, treedp, U);
        vector<ll> ndp(limit + 1);
        for (int j = 0; j <= limit; j++) {
            ndp[j] = max(ndp[j], treedp[v][j]);
        }
        for (int j = 0; j <= limit; j++) {
            for (int k = 0; k + j + cost <= limit; k++) {
                ndp[k + j + cost] =
                    max(ndp[k + j + cost], treedp[v][j] + treedp[x][k]);
            }
        }
        for (int j = 0; j <= limit; j++) {
            treedp[v][j] = max(treedp[v][j], ndp[j]);
        }
    }
}

int main() {
    int N, M;
    cin >> N >> M;
    vector<ll> U(N);
    for (int i = 0; i < N; i++) {
        cin >> U[i];
    }
    vector<int> A(N - 1);
    vector<int> B(N - 1);
    vector<int> C(N - 1);
    for (int i = 0; i < N - 1; i++) {
        cin >> A[i] >> B[i] >> C[i];
    }
    int limit = M / 2;
    ll INF = 100000000000000023;
    vector<vector<ll>> treedp(N, vector<ll>(limit + 1, -INF));
    vector<vector<pii>> graph(N, vector<pii>(0));
    for (int i = 0; i < N - 1; i++) {
        graph[A[i]].push_back(make_pair(B[i], C[i]));
        graph[B[i]].push_back(make_pair(A[i], C[i]));
    }
    // debug(treedp);
    vector<bool> isvisited(N, false);
    dfs(graph, isvisited, 0, treedp, U);

    ll ans = 0;
    for (int i = 0; i <= limit; i++) {
        ans = max(ans, treedp[0][i]);
    }
    cout << ans << endl;
}