class BIT:
    def __init__(self,n):
        self.n = n; self.k = [0]*(n+1)
    def a(self,i,x):
        while i<=self.n: self.k[i] += x; i += i&-i
    def s(self,i):
        t = 0
        while i>0: t += self.k[i]; i -= i&-i
        return t
    def r(self,l,r): return self.s(r)-self.s(l-1)
n,m,k = map(int,input().split())
s = [v-1 for v in map(int,input().split())]
d = [[10**18]*n for _ in range(n)]
for i in range(n): d[i][i] = 0
for _ in range(m):
    a,b,c = map(int,input().split())
    d[a-1][b-1] = d[b-1][a-1] = c
for l in range(n):
    for i in range(n):
        for j in range(n):
            d[i][j] = min(d[i][j],d[i][l]+d[l][j])
bit = BIT(k)
for i in range(1,k+1): bit.a(i,d[s[i-1]][s[i]])
for _ in range(int(input())):
    t,x,y = map(int,input().split())
    if t==1:
        if x>0: bit.a(x,d[s[x-1]][y-1]-d[s[x-1]][s[x]])
        if x<k: bit.a(x+1,d[y-1][s[x+1]]-d[s[x]][s[x+1]])
        s[x] = y-1
    if t==2: print(bit.r(x+1,y))