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
// Author: Kajetan Ramsza
#include "bits/stdc++.h"
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

template<typename F, typename S> ostream& operator<<(ostream& os, const pair<F, S> &p) { return os<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T> ostream &operator<<(ostream & os, const vector<T> &v) { os << "{"; typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) { if( it != v.begin() ) os << ", "; os << *it; } return os << "}"; }

void dbg_out() { cerr<<'\n'; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr<<' '<<H; dbg_out(T...); }

#ifdef DEBUG
#define dbg(...) cerr<<"(" << #__VA_ARGS__ <<"):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 
#endif

int n, m, q;

vector<unordered_map<int, ll>> g;
vi color;

inline void add_edge() {
	int a, b; ll d;
	cin>>a>>b>>d;
	a--; b--;
	g[a].insert({b, d});
	g[b].insert({a, d});
}

void dfs(int v, int p, ll z, int c) {
	if(z < 0) return;
	color[v] = c;
	for(auto [e, d] : g[v]) {
		if(e == p) continue;
		dfs(e, v, z - d, c);
	}
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin>>n>>m>>q;
	g.resize(n);
	rep(i,0,m) add_edge();
	color.assign(n, 0);

	rep(i,0,q) {
		int query;
		cin>>query;
		if(query == 1) add_edge();
		else if(query == 2) {
			int a, b;
			cin>>a>>b;
			a--; b--;
			g[a].erase(b);
			g[b].erase(a);
		} else if(query == 3) {
			int v; cin>>v; v--;
			ll z; cin>>z;
			int c; cin>>c;
			dfs(v, v, z, c);
		} else {
			int v; cin>>v; v--;
			cout<<color[v]<<'\n';
		}
	}
}