백준 - 14938 : 서강그라운드 (G4)

 1N, M, R = map(int, input().split())
 2
 3item = list(map(int, input().split()))
 4G = [[] for _ in range(N)]
 5for _ in range(R):
 6    a, b, c = map(int, input().split())
 7    G[a-1].append((b-1, c))
 8    G[b-1].append((a-1, c))
 9
10def dfs(node, dist):
11    global result
12    if dist > M:
13        return
14    if not visit[node]:
15        result += item[node]
16    visit[node] = True
17
18    for n_node, n_dist in G[node]:
19        dfs(n_node, dist+n_dist)
20
21max_result = 0
22
23for i in range(N):
24    result = 0
25    visit = [False]*N
26    dfs(i, 0)
27    max_result = max(max_result, result)
28
29print (max_result)