from collections import defaultdict
import itertools
import operator 
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
    
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    
    def find1(self, x):
        if self.parents1[self.l[x]] < 0:
            return self.l[x]
        else:
            self.parents1[self.l[x]] = self.find(self.parents1[self.l[x]])
            return self.parents1[self.l[x]]
 
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
 
        if x == y:
            return
 
        if self.parents[x] > self.parents[y]:
            x, y = y, x
 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
 
    def size(self, x):
        return -self.parents[self.find(x)]
    def edges(self,x,y):
        edges = self.parents1[x]
        if y in edges:
            return
        else:
            self.parents1[x].append(y)
            self.parents1[y].append(x)
            self.union(x,y)
    def find_edges(self,x,y):
        edges = self.parents1[x]
        if y in edges:
            return 'Yes'
        else:
            return 'No'
            
    def same(self, x, y):
        return self.find(x) == self.find(y)
 
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
 
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
 
    def group_count(self):
        return len(self.roots())
 
    def all_group_members(self):
        group_members = defaultdict(list)
        group_members1 = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
 
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) 

V, E, K = map(int, input().split())
uf = UnionFind(V)

sum = 0
edges = []
for _ in range(E):
    s, t, w = map(int, input().split())
    edges.append((s-1, t-1,w))
    sum += w
edges.sort()

# 2の過程
cost = 0
for edge in edges:
    s,t,w = edge
    if not uf.same(s, t):
        cost += w
        uf.union(s, t)
t = uf.all_group_members()
for _ in range(K):
    e = int(input())
    t1 = t[0]
    if e in t1:
        print(sum - cost)
    else:
        print(sum - cost+edges[e][0])