import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes")
no = lambda :print("no");No = lambda :print("No")
#######################################################################
inf = 10**18
class SegmentTree:
    # 初期化処理
    # f : SegmentTreeにのせるモノイド
    # default : fに対する単位元
    def __init__(self, size, f=lambda x,y : min(x,y), default=inf):
        self.size = 2**(size-1).bit_length() # 簡単のため要素数Nを2冪にする
        self.default = default
        self.dat = [default]*(self.size*2) # 要素を単位元で初期化
        self.f = f
 
    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])
    def updatef(self, i, x):
        i += self.size
        self.dat[i] = self.f(self.dat[i],x)
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])
 
    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1
 
            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) # モノイドでは可換律は保証されていないので演算の方向に注意
            l >>= 1
            r >>= 1
        res = self.f(lres, rres)
        return res
 
    def query2(self):
        s = 1
        #print(self.size)
        while s<self.size:
            #print(s)
            if self.dat[s*2]>self.dat[s*2+1]:
                s = s*2
            else:
                s = s*2+1
        return s-self.size
    
from heapq import *
INF = 10**18
def dijkstra(g, s, n):
    dist = [INF]*n
    hq = [(0, s)]
    dist[s] = 0
    while hq:
        d, v = heappop(hq)
        if dist[v]!=d:
            continue
        for to, c in g[v]:
            if dist[v] + c < dist[to]:
                dist[to] = dist[v] + c
                heappush(hq, (dist[to], to))
    return dist
n,m,k = na()
s = [x-1 for x in na()]
inf = 10**18
g = [[] for _ in range(n)]
for _ in range(m):
    a,b,c = na()
    a -= 1
    b -= 1
    g[a].append((b,c))
    g[b].append( (a,c))

dist = [dijkstra(g, i, n) for i in range(n)]

def f(x, y):
    return x + y
st = SegmentTree(k, lambda x,y : x+y, 0)
for i in range(k):
    #print(i, dist[s[i]][s[i+1]])
    st.update(i, dist[s[i]][s[i+1]])

q = ni()

for _ in range(q):
    t,x,y = na()
    if t==1:
        y -= 1
        if x>0:
            st.update(x-1, dist[s[x-1]][y])
            #print("update", x-1, dist[s[x-1]][y])
        if x<k:
            st.update(x, dist[y][s[x+1]])
            #print("update", x, dist[y][s[x+1]])
        s[x] = y
    else:
        print(st.query(x,y))