#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcount(s)
#define lb(x) (x&-x)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0' && c<='9')x=x*10 + c-'0',c=getchar();
	return x*f;
}
const int N=3002;
const int K=101;
const int M=5e5+3;
int n,m;
bitset<K>to[K];
int U[M],V[M],G[N][N],anc[N],dfn[N],siz[N],dep[N],tim;
inline void dfs1(int u){
	dfn[u]=++tim;siz[u]=1;
	rep(i,1,n)if(!dfn[i] && G[u][i]){
		dep[i] = dep[u]+1; anc[i]=u;
		dfs1(i);siz[u] += siz[i];
	}
}
inline bool in(int u,int v){return dfn[u]<=dfn[v] && dfn[v]<dfn[u]+siz[u];}
inline void dfs2(int u,int op){
	rep(i,1,n)if(anc[i] == u){
		dfs2(i,op);
		if(!op)rep(j,1,n)G[u][j] += G[i][j];
		else rep(j,1,n)G[j][u] += G[j][i];
	}
}
int main(){
	//freopen("data.in","r",stdin);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	n=read(),m=read();int QQ=read();
	rep(i,1,m){
		U[i]=read(),V[i]=read();
		++G[U[i]][V[i]];
		++G[V[i]][U[i]];
	}
	dfs1(1);dfs2(1,0),dfs2(1,1);
	int lst=0;
	while(QQ--){
		int R=read();
		vector<int>vec(1,1);
		static int a[K],b[K],c[K];
		rep(i,1,R){
			int x=c[i]=(read()+lst)%m+1;
			a[i]=read(),b[i]=read();
			if(dep[U[x]] > dep[V[x]])swap(U[x],V[x]),swap(a[i],b[i]);
			if(anc[V[x]] == U[x])vec.pb(V[x]);
		}
		sort(vec.begin(),vec.end(),[&](int x,int y){return dep[x]<dep[y];});
		static int id[N];rep(i,0,vec.size()-1)id[vec[i]]=i;
		auto get = [&](int v){
			int res=1;
			for(auto u:vec)if(in(u,v) && dep[res] < dep[u])res=u;
			return id[res];
		};
		static int w[K][K];
		const int N=vec.size()-1;
		rep(i,0,N)rep(j,0,N)w[i][j]=0;
		static int sz[K];
		rep(i,0,N)sz[i]=siz[vec[i]];
		per(i,N,0)rep(j,i+1,N)if(in(vec[i],vec[j]))sz[i]-=sz[j];
		//rep(i,0,N)tmp[i]=get(anc[vec[i]]);
		static vector<int>F[K];
		rep(i,0,N)F[i].clear();
		rep(i,1,N)F[get(anc[vec[i]])].pb(vec[i]);
		rep(i,0,N)rep(j,0,N){
			w[i][j]=G[vec[i]][vec[j]];
			for(auto x:F[j])w[i][j]-=G[vec[i]][x];
			for(auto x:F[i])w[i][j]-=G[x][vec[j]];
			for(auto x:F[i])for(auto y:F[j])w[i][j]+=G[x][y];
		}
		rep(i,1,R){
			int u=get(U[c[i]]),v=get(V[c[i]]);
			if(a[i])--w[u][v];
			if(b[i])--w[v][u];
		}
		rep(i,0,N) to[i].reset(),to[i].set(i);
		rep(i,0,N)rep(j,0,N)assert(w[i][j]>=0);
		rep(i,0,N)rep(j,0,N)if(w[i][j])to[j].set(i);
		rep(i,1,R){
			int u=get(U[c[i]]),v=get(V[c[i]]);
			if(!a[i])to[v].set(u);
			if(!b[i])to[u].set(v);
		}
		rep(k,0,N)rep(i,0,N)if(to[i][k])to[i] |= to[k];
		int ans=0;
		rep(i,0,N)if(to[i].count() == N+1)ans += sz[i];
		printf("%d\n",ans);lst+=ans;
	}
	return 0;
}
/*
4 4 3
1 2
4 3
2 3
1 3
2
3 1 1
1 0 1
3
1 1 0
0 1 0
3 1 0
1
1 1 1
*/