n,m=map(int,input().split())
c=[int(input()) for i in range(n)]
e=[[] for i in range(n)]
for i in range(n-1):
  u,v,w=map(int,input().split())
  e[u]+=[(v,w)]
  e[v]+=[(u,w)]
v=[0]*n
u=[[0]*(m+1) for i in range(n)]
q=[0]
while len(q)>0:
  s=q[-1]
  if v[s]==0:
    v[s]=1
    q+=[t for t,w in e[s] if v[t]==0]
  else:
    u[s][0]=c[s]
    for t,w in e[s]:
      if v[t]==0:
        for i in reversed(range(m+1)):
          for j in reversed(range(m-i-w-w+1)):
            u[s][i+w+j+w]=max(u[s][i+w+j+w],u[s][i]+u[t][j])
    v[s]=0
    q.pop()
print(max(u[0]))