import sys
input = sys.stdin.readline

class SegmentTree:
    def __init__(self,
                 n,
                 identity_e,
                 combine_f,
                 ):
        self._n = n
        self._size = 1
        while self._size < self._n:
            self._size <<= 1
        self._identity_e = identity_e
        self._combine_f = combine_f
        self._node = [self._identity_e] * (2 * self._size)
        
    def build(self, array):
        assert len(array) == self._n
        for index, value in enumerate(array, start=self._size):
            self._node[index] = value
        for index in range(self._size - 1, 0, -1):
            self._node[index] = self._combine_f(
                self._node[index << 1 | 0],
                self._node[index << 1 | 1]
            )
            
    def update(self, index, value):
        i = self._size + index
        self._node[i] = value
        while i > 1:
            i >>= 1
            self._node[i] = self._combine_f(
                self._node[i << 1 | 0],
                self._node[i << 1 | 1]
            )
            
    def fold(self, L, R):
        L += self._size
        R += self._size
        value_L = self._identity_e
        value_R = self._identity_e
        while L < R:
            if L & 1:
                value_L = self._combine_f(value_L, self._node[L])
                L += 1
            if R & 1:
                R -= 1
                value_R = self._combine_f(self._node[R], value_R)
            L >>= 1
            R >>= 1
        
        return self._combine_f(value_L, value_R)
    
    
N, M, K = map(int, input().split())
S = list(map(int, input().split()))
inf = 10 ** 18
G = [[inf] * N for i in range(N)]
for i in range(K + 1):
    S[i] -= 1
for i in range(N):
    G[i][i] = 0
    
for i in range(M):
    A, B, C = map(int, input().split())
    A, B = A - 1, B - 1
    G[A][B] = C
    G[B][A] = C
    
from operator import add
T = SegmentTree(N, 0, add)
for k in range(N):
    for i in range(N):
        for j in range(N):
            G[i][j] = min(G[i][j], G[i][k] + G[k][j])
            
for i in range(K):
    T.update(i, G[S[i]][S[i + 1]])
    
Q = int(input())
for _ in range(Q):
    t, x, y = map(int, input().split())
    if t == 1:
        S[x] = y - 1
        if x:
            T.update(x - 1, G[S[x - 1]][S[x]])
        if x != K:
            T.update(x, G[S[x]][S[x + 1]])
    else:
        print(T.fold(x, y))