import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 10**9

N, M = map(int, input().split())
U = [int(input()) for _ in range(N)]
g = [[] for _ in range(N)]
for _ in range(N - 1):
    a, b, c = map(int, input().split())
    g[a].append((b, c))
    g[b].append((a, c))

topo = []
par = [-1] * N
que = [0]
while que:
    s = que.pop()
    topo.append(s)
    for t, c in g[s]:
        if t == par[s]:
            continue
        par[t] = s
        que.append(t)

dp = [[0] for _ in range(N)]
for s in topo[::-1]:
    for t, c in g[s]:
        if t == par[s]:
            continue
        c *= 2
        merge = [0] * (len(dp[s]) + len(dp[t]) + c - 1)
        for i, vs in enumerate(dp[s]):
            for j, vt in enumerate(dp[t]):
                merge[i+j+c] = max(merge[i+j+c], vs + vt)
        if len(merge) > M + 1:
            merge = merge[:M + 1]
        dp[s] = merge
    u = U[s]
    dp[s] = [u + ds for ds in dp[s]]
print(dp[s][M])