#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
using namespace std;
using ll = long long;

int n, tl;

int u[222];
struct edge {
    int s, d, w;
};
vector<vector<edge>> g;

int *solve(int v, int tl, int p) {
    int *res = new int[tl + 1];
    fill(res, res + tl + 1, u[v]);
    for (auto &e : g[v]) {
        if (e.d == p) continue;
        if (tl < e.w * 2) continue;
        int *cdp = solve(e.d, tl - e.w*2, v);
        for (int i = tl; i >= 0; --i) {
            for (int j = 0; j <= tl - e.w * 2; ++j) {
                if (i - j - 2 * e.w >= 0) {
                    res[i] = max(res[i], res[i - j - 2 * e.w] + cdp[j]);
                }
            }
        }
        delete cdp;
    }
    return res;
}

int main() {
    while (cin >> n >> tl) {
        for (int i = 0; i < n; i++) {
            cin >> u[i];
        }
        g.assign(n, {});
        for (int i = 1; i < n; i++) {
            int a, b, e;
            cin >> a >> b >> e;
            g[a].push_back({ a,b,e });
            g[b].push_back({ b,a,e });
        }
        int *a = solve(0, tl, -1);
        cout << a[tl] << endl;
        delete a;
    }
}