n, m, k = map(int, input().split()) a = list(map(int, input().split())) h = list(map(int, input().split())) tmp = [[] for i in range(n)] for i in range(m): start, end, dis = map(int, input().split()) tmp[start - 1].append((end, dis)) tmp[end - 1].append((start, dis)) def dfs(i, k, tmp): if h[i - 1] ...
投递小红书等公司7个岗位