#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
//*
#include <atcoder/all>
using namespace atcoder;
template <class T, internal::is_static_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_static_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " "); cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

int main()
{
  ll N, M, K;
  cin >> N >> M >> K;
  vector<ll> S(K + 1);
  for (ll i = 0; i < K + 1; i++)
  {
    cin >> S.at(i);
    S.at(i)--;
  }
  vector<vector<ll>> D(N, vector<ll>(N, INF));
  for (ll i = 0; i < N; i++)
  {
    D.at(i).at(i) = 0;
  }
  for (ll i = 0; i < M; i++)
  {
    ll a, b, c;
    cin >> a >> b >> c;
    a--, b--;
    D.at(a).at(b) = c;
    D.at(b).at(a) = c;
  }
  for (ll k = 0; k < N; k++)
  {
    for (ll i = 0; i < N; i++)
    {
      for (ll j = 0; j < N; j++)
      {
        chmin(D.at(i).at(j), D.at(i).at(k) + D.at(k).at(j));
      }
    }
  }

  fenwick_tree<ll> fw(K);
  for (ll i = 0; i < K; i++)
  {
    fw.add(i, D.at(S.at(i)).at(S.at(i + 1)));
  }
  ll Q;
  cin >> Q;
  while (Q--)
  {
    ll t;
    cin >> t;
    if (t == 1)
    {
      ll i, v;
      cin >> i >> v;
      v--;
      S.at(i) = v;
      if (i != 0)
      {
        fw.add(i - 1, -fw.sum(i - 1, i));
        fw.add(i - 1, D.at(S.at(i - 1)).at(S.at(i)));
      }
      if (i != K)
      {
        fw.add(i, -fw.sum(i, i + 1));
        fw.add(i, D.at(S.at(i)).at(S.at(i + 1)));
      }
    }
    else if (t == 2)
    {
      ll l, r;
      cin >> l >> r;
      cout << fw.sum(l, r) << "\n";
    }
  }
}