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))

dist = [0]*n
parent = [-1]*n
order = [0]
for v in order:
    for u,c in g[v]:
        if parent[v] == u: continue
        dist[u] = 2*c
        parent[u] = v
        order.append(u)

def merge(v,p,d):
    for i in range(m,d-1,-1):
        for k in range(i-d+1):
            dp[p][i] = max(dp[p][i],dp[p][i-k-d] + dp[v][k])

dp = [[0]*(m+1) for _ in range(n)]
for i in order[n-1:0:-1]:
    for j in range(m+1): dp[i][j] += U[i]
    merge(i,parent[i],dist[i])
print(max(dp[0])+U[0])