#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10, B = 64, K = N / B + 10;

struct Q1
{
	int t, k;
};

struct Q2
{
	int id, t, u, v;
};

int n, m, q, fl[N], used[N], ans[N], idx[N], vis[N];
array<int, 2> el[N];
vector<Q2> q2[K];
int sz[K];
vector<Q1> q1[K];
vector<int> g[N], g2[N], g3[N];
bitset<B << 1> from[N], to[N];

int tick, sccn, dfn[N], low[N], col[N], instk[N];
vector<int> stk;

void tarjan(int x)
{
	tick++, dfn[x] = low[x] = tick;
	stk.push_back(x), instk[x] = true;
	for (int y : g[x])
	{
		if (!dfn[y]) tarjan(y), low[x] = min(low[x], low[y]);
		else if (instk[y]) low[x] = min(low[x], dfn[y]);
	}
	
	if (low[x] == dfn[x])
	{
		sccn++;
		int u;
		do
		{
			u = stk.back(); stk.pop_back(); instk[u] = false;
			col[u] = sccn;
			to[sccn].set(idx[u]), from[sccn].set(idx[u]);
		} while (u != x);
	}
}

int ind[N];

void pre()
{
	queue<int> q;
	vector<int> topo;
	for (int i = 1; i <= sccn; i++)
		if (!ind[i]) q.push(i);
	while (!q.empty())
	{
		int k = q.front(); q.pop();
		topo.push_back(k);
		for (int x : g2[k]) 
		{
			ind[x]--;
			if (!ind[x]) q.push(x);
		}
	}
	
	for (int x : topo)
		for (int y : g3[x])
			from[y] |= from[x];
	reverse(topo.begin(), topo.end());
	for (int x : topo)
		for (int y : g2[x])
			to[x] |= to[y];
}

bool dfs(int x)
{
	if (x == n + 2) return true;
	vis[x] = true;
	for (int y : g2[x])
		if (!vis[y]) 
			if (dfs(y)) return true;
	return false;
}

signed main()
{
	cin >> n >> m >> q;
	for (int i = 1; i <= m; i++) cin >> el[i][0] >> el[i][1], fl[i] = true;
	int qn = ceil(sqrt(q)), k = q / B, cnt2 = 0;
	for (int i = 1; i <= q; i++)
	{
		int op, k, u, v; cin >> op;
		if (op == 1) cin >> k, q1[i / B].push_back({i, k});
		if (op == 2) cin >> u >> v, cnt2++, q2[i / B].push_back({cnt2, i, u, v});
	}
	
	for (int i = 0; i <= k; i++)
	{
		for (int i = 1; i <= n; i++) g[i].clear(), from[i].reset(), to[i].reset(), idx[i] = 0, dfn[i] = 0; tick = sccn = 0;
		for (Q1 q : q1[i]) used[q.k] = true;
		for (int i = 1; i <= m; i++)
			if (fl[i] && !used[i]) g[el[i][0]].push_back(el[i][1]);
		for (Q1 q : q1[i]) used[q.k] = false;
		set<int> qp;
		for (Q2 q : q2[i]) qp.insert(q.u), qp.insert(q.v);
		int cur = 0;
		for (int x : qp) cur++, idx[x] = cur;
		
		for (int i = 1; i <= n; i++)
			if (!dfn[i]) tarjan(i);
		for (int i = 1; i <= sccn; i++) g2[i].clear();
		for (int i = 1; i <= n; i++)
			for (int j : g[i])
				if (col[i] != col[j]) g2[col[i]].push_back(col[j]), g3[col[j]].push_back(col[i]), ind[col[j]]++;
		pre();
		
//		for (int i = 1; i <= n; i++)
//			for (int j = 1; j <= n; j++)
//				if (to[i][j]) printf("to[%d][%d]\n", i, j);
//		
//		printf("***%d\n", i);
//		for (int i = 1; i <= n; i++) printf("idx[%d] = %d\n", i, idx[i]);
		
		for (int i = 1; i <= n + 2; i++) g2[i].clear();
		for (Q2 q : q2[i])
		{
			int t = q.t, u = q.u, v = q.v;
			if (to[col[u]][idx[v]])
			{
				ans[q.id] = 1;
				continue;
			}
			vector<int> edit;
			
			map<array<int, 2>, int> s;
			for (Q1 q : q1[i]) 
			{
				if (q.t > t) break;
				auto e = el[q.k];
				if (s.count(e)) s[e] ^= (q.t < t);
				else s[e] = fl[q.k] ^ (q.t < t);
			}
			for (auto p : s)
			{
				if (!p.second) continue;
				int x = p.first[0], y = p.first[1];
				if (from[col[y]][idx[u]] || to[col[x]][idx[v]]) continue;
				if (from[col[x]][idx[u]]) x = n + 1;
				if (to[col[y]][idx[v]]) y = n + 2;
				g2[x].push_back(y), edit.push_back(x);
			}
			ans[q.id] = dfs(n + 1);
			for (int x : edit) g2[x].clear();
		}
		
		for (Q1 q : q1[i]) fl[q.k] ^= 1;
	}
	
	for (int i = 1; i <= cnt2; i++) cout << (ans[i] ? "YES" : "NO") << '\n';
}