#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <numeric>
#define ll long long
#define mst(x, y) memset(x, y, sizeof(x))
#define ciallo putchar('\n')
#define ilv inline void
#define ili inline int
#define ilb inline bool
#define ill inline long long
constexpr auto N = 1000010;
constexpr auto INF = 0x3f3f3f3f;
constexpr auto eps = 1e-4;
constexpr ll mod = 1e12 + 7;
using namespace std;
vector<vector<pair<int, int>>> map; // <next node, cost>
vector<vector<int>> f;
int uf[210];
int n, m;
void dfs(int u, int par)
{
    f[u][0] = uf[u];
    for (auto it : map[u])
    {
        int next = it.first, cost = it.second;
        if (next == par)
            continue;
        dfs(next, u);
        for (int i = m; i >= 0; --i)
            for (int j = 0; j <= m; ++j)
                if (i + cost * 2 + j <= m)
                    f[u][i + cost * 2 + j] = max(f[u][i + cost * 2 + j], f[u][i] + f[next][j]);
    }
}
int main()
{
    // freopen("tulip.in", "r", stdin);
    // freopen("tulip.out", "w", stdout);
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++)
        cin >> uf[i];
    map.resize(n, vector<pair<int, int>>());
    f.resize(n, vector<int>(m + 1));
    for (int i = 1; i < n; ++i)
    {
        int a, b, c;
        cin >> a >> b >> c;
        map[a].push_back({b, c}), map[b].push_back({a, c});
    }
    dfs(0, -1);
    int ans = 0;
    for (int i = 0; i <= m; ++i)
        ans = max(ans, f[0][i]);
    cout << ans << '\n';
    // fclose(stdin);
    // fclose(stdout);
    return 0;
}