#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ALL(x) (x).begin(), (x).end()
#define PC(x) __builtin_popcount(x)
#define PCL(x) __builtin_popcountll(x)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T>
bool chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b)
{
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7; // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 2E+02;
struct edge {
    int to, cost;
};

ll di[4] = { 0, -1, 0, 1 }, dj[4] = { 1, 0, -1, 0 };

int N, M, U[MAX_N + 1];
vector<edge> G[MAX_N + 1];

vector<int> dfs(int i, int par)
{
    vector dp(M + 1, -INFI);
    dp[0] = U[i];
    for (auto& e : G[i]) {
        if (e.to == par)
            continue;
        auto v = dfs(e.to, i);
        int c = e.cost;
        auto tmp = dp;
        for (int j = 0; j <= M; ++j) {
            for (int k = 0; k <= M; ++k) {
                if (j + k + 2 * c > M)
                    break;
                chmax(tmp[j + k + 2 * c], dp[j] + v[k]);
            }
        }
        swap(dp, tmp);
    }
    return dp;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> M;

    for (int i = 0; i < N; ++i) {
        cin >> U[i];
    }
    for (int i = 1; i <= N - 1; ++i) {
        int a, b, c;
        cin >> a >> b >> c;
        G[a].push_back({ b, c });
        G[b].push_back({ a, c });
    }

    auto dp = dfs(0, -1);

    int ans = -INFI;
    for (int j = 0; j <= M; ++j) {
        chmax(ans, dp[j]);
    }

    cout << ans << "\n";

    return 0;
}