import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class BitSum:
    def __init__(self, n):
        self._n = n+1
        self._table = [0]*self._n
        self._origin = [0]*n

    def __getitem__(self, item):
        return self._origin[item]

    def __setitem__(self, index, value):
        self.add(index, value-self._origin[index])
        self._origin[index] = value

    def add(self, i, x):
        if x == 0: return
        self._origin[i] += x
        i += 1
        while i < self._n:
            self._table[i] += x
            i += i & -i

    def sum(self, r):
        res = 0
        while r > 0:
            res += self._table[r]
            r -= r & -r
        return res

    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r)
        return self.sum(r)-self.sum(l)

    # return "min(i) of sum(a[0]..a[i])>=x" or "N"
    def bisect(self, x):
        idx = 0
        d = 1 << (self._n-1).bit_length()-1
        while d:
            if idx | d < self._n and self._table[idx | d] < x:
                idx |= d
                x -= self._table[idx]
            d >>= 1
        return idx

n, m, k = LI()
ss = LI1()
dd = [[inf]*n for _ in range(n)]
for _ in range(m):
    u, v, c = LI()
    u, v = u-1, v-1
    dd[u][v] = dd[v][u] = min(dd[u][v], c)
for u in range(n): dd[u][u] = 0
for v in range(n):
    for u in range(n):
        for w in range(n):
            dd[u][w] = min(dd[u][w], dd[u][v]+dd[v][w])

bit = BitSum(k)
for i, (s, t) in enumerate(zip(ss, ss[1:])):
    bit[i] = dd[s][t]

for _ in range(II()):
    t, x, y = LI()
    if t == 2:
        print(bit.sumlr(x, y))
    else:
        i = x
        ss[i] = y-1
        if i: bit[i-1] = dd[ss[i-1]][ss[i]]
        if i+1 <= k: bit[i] = dd[ss[i+1]][ss[i]]