#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

ll op(ll a, ll b){return a + b;}
ll e(){return 0ll;}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, M, K; cin >> N >> M >> K;
    vector<int> S(K + 1);
    rep(i,K + 1) {
        cin >> S[i];
        S[i]--;
    }
    vector dist(N, vector<ll>(N, LINF));
    rep(i,M){
        int A, B, C; cin >> A >> B >> C;
        A--;
        B--;
        dist[A][B] = dist[B][A] = C;
    }
    rep(k,N)rep(i,N)rep(j,N)chmin(dist[i][j], dist[i][k] + dist[k][j]);

    debug(dist);
    debug(S);
    segtree<ll,op,e> seg(K);
    rep(i,K) seg.set(i, dist[S[i]][S[i + 1]]);

    int Q; cin >> Q;
    while(Q--){
        int T, X, Y; cin >> T >> X >> Y;
        debug(T, X, Y);
        if(T==2){
            cout << seg.prod(X, Y) << endl;
        }
        else{
            Y--;
            if(X)seg.set(X - 1, dist[S[X - 1]][Y]);
            if(X<K)seg.set(X, dist[Y][S[X + 1]]);
            S[X] = Y;
        }
    }
}