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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const ll M = 1000LL * 1000LL * 1000LL + 7LL;
const int N = 1000 * 1000 + 7;
int col[N];
set<pair<int, int>> ed[N];

void DFSC(int v, ll dis, int o, int clr)
{
    col[v] = clr;
    set<pair<int, int>>::iterator it;
    for(it = ed[v].begin(); it != ed[v].end(); ++it)
    {
        if(o == (*it).st || dis < (*it).nd) continue;
        DFSC((*it).st, dis - (ll)((*it).nd), v, clr);
    }
}

inline void Del(int a, int b)
{
    set<pair<int, int>>::iterator it = ed[a].lower_bound(make_pair(b, 0));
    ed[a].erase(it);
}

void Solve()
{
    int n, m, q, r, a, b, c; ll d;
    cin >> n >> m >> q;
    for(int i = 1; i <= m; ++i)
    {
        cin >> a >> b >> c;
        ed[a].insert(make_pair(b, c));
        ed[b].insert(make_pair(a, c));
    }
    for(int i = 1; i <= q; ++i)
    {
        cin >> r;
        if(r == 1)
        {
            cin >> a >> b >> c;
            ed[a].insert(make_pair(b, c));
            ed[b].insert(make_pair(a, c));
        }
        if(r == 2)
        {
            cin >> a >> b;
            Del(a, b);
            Del(b, a);
        }
        if(r == 3)
        {
            cin >> a >> d >> c;
            DFSC(a, d, 0, c);
        }
        if(r == 4)
        {
            cin >> a;
            cout << col[a] << "\n";
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}