class SegTree: #右開区間による実装
    def __init__(self,init_val,segfunc,ide_ele):
        n=len(init_val)
        self.segfunc=segfunc
        self.ide_ele=ide_ele
        self.num=1<<(n-1).bit_length()
        self.tree=[ide_ele]*2*self.num
        for i in range(n):
            self.tree[self.num+i]=init_val[i]
        for i in range(self.num-1,0,-1):
            self.tree[i]=self.segfunc(self.tree[2*i],self.tree[2*i+1])

    def add(self,k,x):
        assert 0<=k<self.num
        k+=self.num
        self.tree[k]+=x
        k>>=1
        while k>0:
            self.tree[k]=self.segfunc(self.tree[2*k],self.tree[2*k+1])
            k>>=1

    def update(self,k,x):
        assert 0<=k<self.num
        k+=self.num
        self.tree[k]=x
        k>>=1
        while k>0:
            self.tree[k]=self.segfunc(self.tree[2*k],self.tree[2*k+1])
            k>>=1
    
    def get(self,k):
        assert 0<=k<self.num
        return self.tree[k+self.num]

    def query(self,l,r):
        assert l>=0
        assert r<=self.num
        res=self.ide_ele
        l+=self.num
        r+=self.num
        while l<r:
            if l&1:
                res=self.segfunc(res,self.tree[l])
                l+=1
            if r&1:
                r-=1
                res=self.segfunc(res,self.tree[r])
            l>>=1
            r>>=1
        return res
    
N,M,K=map(int,input().split())
S=list(map(lambda x:int(x)-1,input().split()))
D=[[10**18]*N for _ in range(N)]
for _ in range(M):
    a,b,c=map(int,input().split())
    a-=1
    b-=1
    D[a][b]=c
    D[b][a]=c

for i in range(N):
    D[i][i]=0

for k in range(N):
    for i in range(N):
        for j in range(N):
            D[i][j]=min(D[i][j],D[i][k]+D[k][j])

L=[0]*K
for i in range(K):
    L[i]=D[S[i]][S[i+1]]

st=SegTree(L,lambda x,y:x+y,0)

Q=int(input())
for _ in range(Q):
    t,x,y=map(int,input().split())
    if t==1:
        y-=1
        if x==0:
            S[0]=y
            st.update(0,D[S[0]][S[1]])
        elif x==K:
            S[K]=y
            st.update(K-1,D[S[K-1]][S[K]])
        else:
            S[x]=y
            st.update(x-1,D[S[x-1]][S[x]])
            st.update(x,D[S[x]][S[x+1]])
    if t==2:
        print(st.query(x,y))