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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define PPC(x) __builtin_popcountll(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define LSB(x) __builtin_ctzll(x)
#define ARG(x, i) (get<i>(x))
#define ithBit(m, i) ((m) >> (i) & 1)
#define pb push_back
#define ft first
#define sd second
#define kw(a) ((a) * (a))
#define CLR(x) x.clear(), x.shrink_to_fit()
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
 
template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = max(a, (T1)b);	}

const int maxN = 1 << 18;

set <pair <int, int> > G[maxN];
int C[maxN];

void rmvNgb(int a, int b)
{
	auto it = G[a].lower_bound({ b, 0 });
	G[a].erase(it);
}

void dfs(int v, long long d, int c, int fat)
{
	C[v] = c;
	for (const auto& [u, e] : G[v])
		if (u != fat and e <= d)
			dfs(u, d - e, c, v);
}

void solve()
{
	int n, m, q;
	scanf ("%d%d%d", &n, &m, &q);
	
	while (m--)
	{
		int a, b, c;
		scanf ("%d%d%d", &a, &b, &c);
		G[a].insert({ b, c });
		G[b].insert({ a, c });
	}	
	while (q--)
	{
		int event;
		scanf ("%d", &event);
		if (event == 1)
		{
			int a, b, c;
			scanf ("%d%d%d", &a, &b, &c);
			G[a].insert({ b, c });
			G[b].insert({ a, c });
		}
		if (event == 2)
		{
			int a, b;
			scanf ("%d%d", &a, &b);
			rmvNgb(a, b);
			rmvNgb(b, a);
		}
		if (event == 3)
		{
			int v, color;
			long long dist;
			scanf ("%d%lld%d", &v, &dist, &color);

			dfs(v, dist, color, 0);
		}
		if (event == 4)
		{
			int v;
			scanf ("%d", &v);
			printf("%d\n", C[v]);
		}
	}
}

int main()
{
	int t = 1;
//	scanf ("%d", &t);	
	FOR(tid, 1, t+1)
	{
		//printf("Case #%d: ", tid);
		solve();
	}
	return 0;
}