import sys
input = sys.stdin.readline

N,M=map(int,input().split())
U=[int(input()) for i in range(N)]

E=[[] for i in range(N)]
COST=dict()
for i in range(N-1):
    a,b,c=map(int,input().split())
    E[a].append((b,c))
    E[b].append((a,c))

    COST[a,b]=c
    COST[b,a]=c

# オイラーツアー
from collections import deque
QUE = deque([0])
QUE2 = deque()
EULER=[] # これが1からツアーで辿った点
USED=[0]*(N+1)
while QUE:
    x=QUE.pop()
    EULER.append(x)
    if USED[x]==1:
        continue
    for to,_ in E[x]:

        if USED[to]==0:
            QUE2.append(to)
        else:
            QUE.append(to)
    QUE.extend(QUE2)
    QUE2=deque()

    USED[x]=1

DP=[[0]*(M+1) for i in range(N)]
DP[0][0]=U[0]

USE=[0]*N
FIRST=[0]*len(EULER)

for i in range(len(EULER)):
    if USE[EULER[i]]==0:
        FIRST[i]=1
        USE[EULER[i]]=1

for i in range(len(EULER)-1):
    x,y=EULER[i],EULER[i+1]
    cost=COST[x,y]

    if FIRST[i+1]==1:
        for j in range(M-cost,-1,-1):
            DP[y][j+cost]=max(DP[y][j+cost],DP[x][j]+U[y])

    else:
        for j in range(M-cost,-1,-1):
            DP[y][j+cost]=max(DP[y][j+cost],DP[x][j])

print(max(DP[0]))