#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
int n, m, q;
const int N = 3005;
const int M = 500005;
int U[M], V[M];
const int K = 101;
int e[N][N];
int s[N][N];

int w[N][N];

std::bitset<K> ee[K];
int vis[N], dep[N];
int dfn[N], size[N];
int anc[N];
int sz[N];
int cc;
std::vector<int> son[N];
void dfs0(int x, int fa = 0) {
	vis[x] = 1;
	anc[x] = fa;
	dep[x] = dep[fa] + 1;
	dfn[x] = ++cc, size[x] = 1;
	for(int i = 1;i <= n;++i) if(!vis[i] && e[x][i]) {
		son[x].push_back(i);
		dfs0(i, x);
		size[x] += size[i];
	}
}
int in(int x, int y) {
	return dfn[y] <= dfn[x] && dfn[x] < dfn[y] + size[y];
}
int u[N], v[N], a[N], b[N];
void dfs1(int x, int type) {
	for(int i : son[x]) {
		dfs1(i, type);
		if(type == 1) {
			for(int j = 1;j <= n;++j) {
				s[x][j] += s[i][j];
			}
		} else {
			for(int j = 1;j <= n;++j) {
				s[j][x] += s[j][i];
			}
		}
	}
}
std::vector<int> vs[N];

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> m >> q;
	for(int i = 0, x, y;i < m;++i) {
		cin >> x >> y;
		U[i] = x;
		V[i] = y;
		++ e[x][y];
		++ e[y][x];
	}
	dfs0(1);
	for(int i = 1;i <= n;++i) {
		for(int j = 1;j <= n;++j) {
			s[i][j] = e[i][j];
		}
	}
	dfs1(1, 1);
	dfs1(1, 2);
	int last = 0;
	for(int i = 0;i < q;++i) {
		int r;
		cin >> r;
		std::vector<int> set = {1};
		for(int j = 0;j < r;++j) {
			int x;
			cin >> x >> a[j] >> b[j];
			x = (x + last) % m;
			u[j] = U[x];
			v[j] = V[x];
			if(dep[u[j]] > dep[v[j]]) {
				std::swap(u[j], v[j]);
				std::swap(a[j], b[j]);
			}
			if(anc[v[j]] == u[j])
				set.push_back(v[j]);
		}
		auto cmp = [&](int x, int y) { return dfn[x] < dfn[y]; };
		sort(set.begin(), set.end(), cmp);
		set.erase(unique(set.begin(), set.end()), set.end());
		auto gid = [&](int x) {
			return lower_bound(set.begin(), set.end(), x, cmp) - set.begin();
		};
		auto getanc = [&](int x, bool t = 0) {
			int anc = 1;
			for(int y : set)  {
				if(t && x == y) continue;
				if(in(x, y) && dep[y] > dep[anc]) anc = y;
			}
			return gid(anc);
		};
		int N = set.size();
		for(int i = 0;i < N;++i) vs[i].clear();
		for(int x : set) {
			if(x == 1) continue;
			vs[getanc(x, 1)].push_back(gid(x));
		}
		for(int i = 0;i < N;++i) {
			sz[i] = size[set[i]];
			for(int j = 0;j < N;++j) {
				w[i][j] = s[set[i]][set[j]];
			}
		}
		for(int i = 0;i < N;++i) 
			for(int x : vs[i]) sz[i] -= sz[x];
		for(int i = 0;i < N;++i) 
			for(int j = 0;j < N;++j) 
				for(int x : vs[i]) w[i][j] -= w[x][j];
		for(int i = 0;i < N;++i) 
			for(int j = 0;j < N;++j) 
				for(int x : vs[j]) w[i][j] -= w[i][x];
		for(int j = 0;j < r;++j) {
			int A = getanc(u[j]);
			int B = getanc(v[j]);
			if(a[j]) -- w[A][B];
			if(b[j]) -- w[B][A];
		}
		for(int i = 0;i < N;++i) {
			ee[i].reset();
		}
		for(int i = 0;i < N;++i) {
			ee[i].set(i);
			for(int j = 0;j < N;++j) {
				if(w[i][j]) ee[j].set(i);
			}
		}
		for(int k = 0;k < N;++k) {
			for(int i = 0;i < N;++i) if(ee[i].test(k)) {
				ee[i] |= ee[k];
			}
		}
		int ans = 0;
		for(int i = 0;i < N;++i) {
			if(ee[i].count() == N) {
				ans += sz[i];
			}
		}
		cout << ans << '\n';
		last += ans;
	}
}