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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#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 MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

long long n, m, t, a, b, c, d, q;
long long ile_t[10];
vector <pair<pair<long long, long long>, pair<long long, long long>>> queries;

struct wierzcholek
{
    set <pair<int, int>> s;
    int kolor;
};
wierzcholek tab[1000007];

void koloruj_brut(int nr, int o, long long dl, int kolor)
{
    //cout << " koloruje " << nr << " na " << kolor << '\n';
    tab[nr].kolor = kolor;
    for(auto el : tab[nr].s)
        if(el.ff != o && el.ss <= dl)
        {
            koloruj_brut(el.ff, nr, dl-el.ss, kolor);
        }
}

void solve_brut()
{
    for(auto el : queries)
    {
        t = el.ff.ff;
        //cout << "zapytanie " << t << '\n';
        if(t == 1)
        {
            a = el.ff.ss;
            b = el.ss.ff;
            d = el.ss.ss;
            tab[a].s.insert({b, d});
            tab[b].s.insert({a, d});
        }
        else if(t == 2)
        {
            a = el.ff.ss;
            b = el.ss.ff;
            tab[a].s.erase(tab[a].s.lower_bound({b, -1}));
            tab[b].s.erase(tab[b].s.lower_bound({a, -1}));
        }
        else if(t == 3)
        {
            koloruj_brut(el.ff.ss, -1, el.ss.ff, el.ss.ss);
        }
        else if(t == 4)
        {
            cout << tab[el.ff.ss].kolor << '\n';
        }
    }
}

void solve_tree()
{
    //cout << "drzewo" << '\n';
    solve_brut();
}

int solve()
{
    cin >> n >> m >> q;
    forr(i, m)
    {
        cin >> a >> b >> c;
        tab[a].s.insert({b, c});
        tab[b].s.insert({a, c});
    }
    forr(i, q)
    {
        cin >> t;
        if(t == 1 || t == 3)
        {
            cin >> a >> b >> d;
        }
        else if(t == 2)
        {
            cin >> a >> b;
        }
        else // t == 4
        {
            cin >> a;
        }
        ile_t[t]++;
        queries.PB({{t, a}, {b, d}});
    }

    if(ile_t[1] == 0 && ile_t[2] == 0 && m == n-1)
        solve_tree();
    else
        solve_brut();

    return 0;
}

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

    solve();

    return 0;
}