#include #include using namespace std; using namespace atcoder; #define rep(i, n) for (long long i = 0; i < (long long)(n); i++) #define rrep(i,start,end) for (long long i = start;i >= (long long)(end);i--) #define repn(i,end) for(long long i = 0; i <= (long long)(end); i++) #define reps(i,start,end) for(long long i = start; i < (long long)(end); i++) #define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++) #define each(p,a) for(auto &p:a) typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef vector vll; typedef vector> vpll; typedef vector> vvll; typedef set sll; typedef map mpll; typedef pair pll; typedef tuple tpl3; #define LL(...) ll __VA_ARGS__; input(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; input(__VA_ARGS__) #define Str(...) string __VA_ARGS__; input(__VA_ARGS__) #define Ch(...) char __VA_ARGS__; input(__VA_ARGS__) #define all(a) (a).begin(),(a).end() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); // << std::fixed << std::setprecision(10) const ll INF = 1LL << 60; const ld EPS = 1e-9; inline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;} inline ll positive_mod(ll a,ll m){return (a % m + m)%m;} inline ll popcnt(ull a){ return __builtin_popcountll(a);} template bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;} template bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;} template std::istream &operator>>(std::istream&is,std::vector&v){for(T &in:v){is>>in;}return is;} template std::ostream &operator<<(std::ostream&os,const std::vector&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;} templatevoid input(T&... a){(cin >> ... >> a);} void print(){cout << endl;} templatevoid print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;} template void pspace(const T& a){ cout << a << ' ';} void perr(){cerr << endl;} templatevoid perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;} void yes(bool i = true){ return print(i?"yes":"no"); } void Yes(bool i = true){ return print(i?"Yes":"No"); } void YES(bool i = true){ return print(i?"YES":"NO"); } //grid探索用 vector _ta = {0,0,1,-1,1,1,-1,-1}; vector _yo = {1,-1,0,0,1,-1,1,-1}; bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);} ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;} ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} const ll MOD9 = 998244353LL; const ll MOD10 = 1000000007LL; class RSQ{ public: vector tree; ll siz = 0; RSQ(ll n){ ll i = 0; while((1 << i) < n ){ i++; } tree.resize(1<<(i+1)); siz = 1 << i; } void init(ll n){ ll i = 0; while((1 << i) < n ){ i++; } tree.resize(1<<(i+1)); siz = 1 << i; } void update(ll pos, ll x){ pos = pos + siz-1; tree[pos] = x; while(pos >= 1){ pos = (pos-1)/2; tree[pos] = tree[2 * pos +1]+tree[2 * (pos+1)]; } } //[l,r) について、最初はa = 0,b = (SegmentTree).siz, p = 0 にしておく ll _query(ll l, ll r, ll a, ll b, ll p){ if(r <= a or l >= b){ return 0; } if(l <= a and b <= r){ return tree[p]; } ll m = (a + b)/2; ll ansl = _query(l,r,a,m,2 * p+1); ll ansr = _query(l,r,m,b,2 * (p+1)); return ansl + ansr; } ll query(ll l ,ll r){ return _query(l,r,0,siz,0); } ll operator[](ll pos){ return tree[pos + siz -1]; } }; using P = pair; void Dijkstra(vector &dis,vector>> &G,ll s){ // G[i] i->j の距離(d) // 「仮の最短距離, 頂点」が小さい順に並ぶ priority_queue,greater

>pq; dis[s] = 0; pq.push({dis[s],s}); while(!pq.empty()){ auto [len,now] = pq.top(); pq.pop(); if(dis[now]< len){ continue; } for(auto &p:G[now]){ // 注意! auto [next,cost] = p; if(dis[next] > dis[now] + cost){ dis[next] = dis[now] + cost; pq.push({dis[next],next}); } } } } int main(){ ios::sync_with_stdio(false);cin.tie(nullptr); LL(n,m,k); k++; vll s(k); cin >> s; rep(i,k){ s[i]--; } vector g(n); rep(i,m){ LL(a,b,c); a--;b--; g[a].push_back({b,c}); g[b].push_back({a,c}); } vvll dist(n,vll(n,INF)); rep(i,n){ Dijkstra(dist[i],g,i); } RSQ seg(k);//seg[i] = i -> i+1の移動コスト rep(i,k-1){ seg.update(i,dist[s[i]][s[i+1]]); } LL(q); rep(z,q){ LL(t,x,y); if(t == 1){ y--; s[x] = y; if(x != k-1){ seg.update(x,dist[s[x]][s[x+1]]); } if(x != 0){ seg.update(x-1,dist[s[x-1]][s[x]]); } }else{ // x--;y--; cout << seg.query(x,y) << endl;; } } }