#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000;
struct binary_indexed_tree{
  int N;
  vector<long long> BIT;
  binary_indexed_tree(int N): N(N), BIT(N + 1, 0){
  }
  void add(int i, long long x){
    i++;
    while (i <= N){
      BIT[i] += x;
      i += i & -i;
    }
  }
  long long sum(int i){
    long long ans = 0;
    while (i > 0){
      ans += BIT[i];
      i -= i & -i;
    }
    return ans;
  }
  long long sum(int L, int R){
    return sum(R) - sum(L);
  }
};
int main(){
  int N, M, K;
  cin >> N >> M >> K;
  vector<int> S(K + 1);
  for (int i = 0; i <= K; i++){
    cin >> S[i];
    S[i]--;
  }
  vector<vector<long long>> E(N, vector<long long>(N, INF));
  for (int i = 0; i < N; i++){
    E[i][i] = 0;
  }
  for (int i = 0; i < M; i++){
    int A, B, C;
    cin >> A >> B >> C;
    A--;
    B--;
    E[A][B] = C;
    E[B][A] = C;
  }
  for (int i = 0; i < N; i++){
    for (int j = 0; j < N; j++){
      for (int k = 0; k < N; k++){
        E[j][k] = min(E[j][k], E[j][i] + E[i][k]);
      }
    }
  }
  binary_indexed_tree BIT(K);
  for (int i = 0; i < K; i++){
    BIT.add(i, E[S[i]][S[i + 1]]);
  }
  int Q;
  cin >> Q;
  for (int i = 0; i < Q; i++){
    int T;
    cin >> T;
    if (T == 1){
      int X, Y;
      cin >> X >> Y;
      Y--;
      if (X > 0){
        BIT.add(X - 1, -E[S[X - 1]][S[X]]);
      }
      if (X < K){
        BIT.add(X, -E[S[X]][S[X + 1]]);
      }
      S[X] = Y;
      if (X > 0){
        BIT.add(X - 1, E[S[X - 1]][S[X]]);
      }
      if (X < K){
        BIT.add(X, E[S[X]][S[X + 1]]);
      }
    }
    if (T == 2){
      int X, Y;
      cin >> X >> Y;
      cout << BIT.sum(X, Y) << endl;
    }
  }
}