#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

int N, M;
ll U[201];
ll dp[201][2010];
vector<int> E[101];
ll C[201][201];

void dfs(int u, int p = -1) {
  for (int v : E[u]) {
    if (v == p) continue;

    for (int i = 0; i + 2 * C[u][v] <= M; ++i) {
      if (dp[u][i] == -1) continue;

      int t = i + C[u][v];
      dp[v][t] = max(dp[v][t], dp[u][i] + U[v]);
    }

    dfs(v, u);
  }

  if (p != -1) {
    for (int i = 0; i + C[u][p] <= M; ++i) {
      if (dp[u][i] == -1) continue;

      int t = i + C[u][p];
      dp[p][t] = max(dp[p][t], dp[u][i]);
    }
  }
}

int main() {
  memset(C, 0, sizeof(C));
  memset(dp, -1, sizeof(dp));
  cin >> N >> M;

  for (int i = 0; i < N; ++i) {
    cin >> U[i];
  }

  int a, b;
  ll c;
  for (int i = 0; i < N - 1; ++i) {
    cin >> a >> b >> c;

    E[a].push_back(b);
    E[b].push_back(a);
    C[a][b] = c;
    C[b][a] = c;
  }

  dp[0][0] = 0;
  dfs(0);

  ll ans = 0;

  for (int i = 0; i <= M; ++i) {
    ans = max(ans, dp[0][i]);
  }

  cout << ans + U[0] << endl;

  return 0;
}