#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np

# %%
N, M = map(int, readline().split())
U = [int(readline()) for _ in range(N)]
m = map(int, read().split())
ABC = zip(m, m, m)

# %%
graph = [[] for _ in range(N)]
for a, b, c in ABC:
    graph[a].append((b, c))
    graph[b].append((a, c))

# %%
root = 0
parent = [0] * N
order = []
stack = [root]
while stack:
    x = stack.pop()
    order.append(x)
    for y, _ in graph[x]:
        if y == parent[x]:
            continue
        parent[y] = x
        stack.append(y)

M //= 2

# %%


def merge(A, B):
    C = np.zeros(M + 1, np.int64)
    for i, x in enumerate(A):
        np.maximum(C[i:], B[: M + 1 - i] + x, out=C[i:])
    return C


# %%
dp = [None] * N
for v in order[::-1]:
    A = np.zeros(M + 1, np.int64)
    A[0] = U[v]
    for w, cost in graph[v]:
        if cost > M or w == parent[v]:
            continue
        B = np.zeros(M + 1, np.int64)
        B[cost: M + 1] = dp[w][: M + 1 - cost]
        A = merge(A, B)
    dp[v] = A


# %%
print(dp[0].max())