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
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define fi first
#define se second
#define pn printf("\n")
#define ssize(x) int(x.size())
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define bitcount(x) __builtin_popcount(x)
#define clz(x) __builtin_clz(x)
#define ctz(x) __builtin_ctz(x)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef double db;
typedef long double ldb;
#define vv vector
/*void read(int &a){
		char c = getchar_unlocked(); a = 0;
		while(c<'0' || '9'<c) c = getchar_unlocked();
		while('0'<=c&&c<='9') a = (a<<3)+(a<<1)+c-'0', c = getchar_unlocked();
}*/
int inf = 2e09; ll infll = 2e18; int mod = (1<<23)*119+1;
int add(int a, int b){return a+b >= mod ? a+b - mod : a+b;}
int sub(int a, int b){return a-b < 0 ? a-b + mod : a-b;}
int mul(int a, int b){return int(a * ll(b) % mod);}
int fpow(int a, int b){
		int ret = 1;
		while(b){
				if(b & 1) ret = mul(ret, a);
				b >>= 1, a = mul(a, a);
		} return ret;
}
int inv(int a){ return fpow(a, mod-2); }
int coeff(int n, int k, vector<int> &fac, vector<int> &invfac){
		if(n < k) return 0;
		return mul(fac[n], mul(invfac[n-k], invfac[k]));
}
void calcfac(int n, vector<int> &fac, vector<int> &invfac){
		fac[0] = 1, invfac[0] = 1;
		for(int i = 1; i <= n; ++i) fac[i] = mul(fac[i-1], i);
		invfac[n] = inv(fac[n]);
		for(int i = n-1; i; --i) invfac[i] = mul(invfac[i+1], i+1);
}
struct graph{
		vv<set<pii>> g;
		vv<int> col;
		void init(int n){
				g.resize(n+1), col.resize(n+1, 0);
		}
		void add_edge(int a, int b, int c){
				g[a].emplace(b, c), g[b].emplace(a, c);
		}
		void remove_edge(int a, int b){
				g[a].erase(g[a].lower_bound(pii(b, 0))), g[b].erase(g[b].lower_bound(pii(a, 0)));
		}
		void dfs(int x, int par, ll d, ll &dlimit, int &c){
				col[x] = c;
				for(pii u : g[x]) if(u.fi != par && d+u.se <= dlimit) dfs(u.fi, x, d+u.se, dlimit, c);
		}
};
void answer(){
		int n, m, q; scanf("%d%d%d", &n, &m, &q);
		graph g; g.init(n);
		for(int i = 1; i <= m; ++i){
				int a, b, c; scanf("%d%d%d", &a, &b, &c);
				g.add_edge(a, b, c);
		}
		for(++q; --q; ){
				int t, a, b; ll c; scanf("%d", &t);
				if(t == 1){
						scanf("%d%d%lld", &a, &b, &c), g.add_edge(a, b, int(c));
				}
				else if(t == 2) scanf("%d%d", &a, &b), g.remove_edge(a, b);
				else if(t == 3) scanf("%d%lld%d", &a, &c, &b), g.dfs(a, 0, 0, c, b);
				else scanf("%d", &a), printf("%d\n", g.col[a]);
		}
}
signed main(){
		int T = 1;
		//~ scanf("%d", &T);
		//~ ios_base::sync_with_stdio(0); cin.tie(0); //cin >> T;
		for(++T; --T; ) answer();
		return 0;
}