class segtree:
  def __init__(self,n):
    self.size=1
    while self.size<n:
      self.size*=2
    self.dat=[0]*(self.size*2)
  def update(self,x,a):
    x+=self.size
    self.dat[x]=a
    while x>1:
      x//=2
      self.dat[x]=(self.dat[2*x]+self.dat[2*x+1])
  def querry(self,u,v):
    u+=self.size
    v+=self.size
    score=0
    while u<v:
      if u&1:
        score+=self.dat[u]
        u+=1
      if v&1:
        v-=1
        score+=self.dat[v]
      u//=2
      v//=2
    return score
N,M,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(K+1):
  A[i]-=1
dist=[[10**15]*N for i in range(N)]
for i in range(N):
  dist[i][i]=0
for i in range(M):
  a,b,c=map(int,input().split())
  dist[a-1][b-1]=c
  dist[b-1][a-1]=c
for k in range(N):
  for i in range(N):
    for j in range(N):
      dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j])
Z=segtree(K)
for i in range(K):
  pos=A[i]
  pos2=A[i+1]
  Z.update(i,dist[pos][pos2])
Q=int(input())
for i in range(Q):
  t,x,y=map(int,input().split())
  if t==1:
    A[x]=y-1
    if x>0:
      Z.update(x-1,dist[A[x]][A[x-1]])
    if x<K:
      Z.update(x,dist[A[x]][A[x+1]])
  else:
    result=Z.querry(x,y)
    print(result)