1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define PB push_back
#define EB emplace_back
#define FI first
#define SE second
#define umap unordered_map
#define uset unordered_set
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vpii vector<pii>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ALL(X) (X).begin(),(X).end()
#ifndef DEBUG
#define endl (char)10
#endif
using namespace std;
using ll = long long;
using ld = long double;

template <class T>
istream& operator>> (istream& is, vector<T>& vec){
    FOR(i,0,vec.size()) is >> vec[i];
    return is;
}
template <class T>
ostream& operator<< (ostream& os, vector<T>& vec){
    for(auto& t : vec) os << t << " ";
    return os;
}
template<class T, class U>
ostream& operator<< (ostream& os, const pair<T, U>& p){
    os << p.FI << " " << p.SE;
    return os;
}
template<class T, class U>
istream& operator>> (istream& is, pair<T, U>& p){
    is >> p.FI >> p.SE;
    return is;
}

struct query {
	int t;
	int a;
	ll b;
	int c;
};

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m, qqq;
    cin >> n >> m >> qqq;
    vector<map<int, int>> V(n);
    vector<query> Q(qqq);
    FOR(i,0,m){
		int a, b, d;
		cin >> a >> b >> d;
		a--; b--;
		V[a][b] = d;
		V[b][a] = d;
	}
	FOR(i,0,qqq){
		cin >> Q[i].t >> Q[i].a;
		Q[i].a--;
		if (Q[i].t == 1) {
			cin >> Q[i].b >> Q[i].c;
			Q[i].b--;
		} else if (Q[i].t == 2) {
			cin >> Q[i].b;
			Q[i].b--;
		} else if (Q[i].t == 3) cin >> Q[i].b >> Q[i].c;
	}
	vi color(n, 0);
	vll D(n);
	for(auto& q : Q){
		if (q.t == 4){
			cout << color[q.a] << endl;
		} else if (q.t == 1){
			V[q.a][q.b] = q.c;
			V[q.b][q.a] = q.c;
		} else if (q.t == 2) {
			V[q.a].erase(q.b);
			V[q.b].erase(q.a);
		} else {
			FOR(i,0,n) D[i] = q.b + 1;
			priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> K;
			D[q.a] = 0;
			K.emplace(0, q.a);
			while(!K.empty()){
				auto c = K.top();
				//cout << "Sciaglem " << c << endl;
				K.pop();
				if (D[c.SE] != c.FI) continue;
				//cout << "RECOLOR " << c.SE << " " << q.c << endl;
				color[c.SE] = q.c;
				for(const auto& s : V[c.SE]){
					ll nd = c.FI + s.SE;
					if (nd < D[s.FI]) {
						K.emplace(nd, s.FI);
						D[s.FI] = nd;
					}
				}
			}
		}
	}
}