n,m=map(int,input().split())
m//=2
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)]
u=[[c[i]]*(m+1) for i in range(n)]

def dfs(s,p):
  for t,w in e[s]:
    if t!=p:
      dfs(t,s)
      for i in reversed(range(m-w+1)):
        for j in reversed(range(m-i-w+1)):
          u[s][i+w+j]=max(u[s][i+w+j],u[s][i]+u[t][j])

dfs(0,0)
print(max(u[0]))