#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
const int N=1e5+10;
const ld PI=acos(ld(-1));
ld sq(ld x){return x*x;}
struct point{
	ld x,y;
}p[N],a[N];
point operator +(point a,point b){return {a.x+b.x,a.y+b.y};}
point operator -(point a,point b){return {a.x-b.x,a.y-b.y};}
ld operator *(point a,point b){return a.x*b.y-a.y*b.x;}
ld dis(point a,point b){return sqrt(sq(a.x-b.x)+sq(a.y-b.y));}
bool chk(ld a,ld b)
{
	return abs(a-b)<=1e-18;
}
bool chk(int n)
{
	point s={0,0};
	for(int i=1;i<=n;i++) s=s+a[i];
	s.x/=n,s.y/=n;
	ld cur=dis(s,a[1]);
	for(int i=2;i<=n;i++)
		if(!chk(dis(s,a[i]),cur)) return 0;
	for(int i=2;i<=n;i++)
		if(a[i].y<a[1].y) swap(a[i],a[1]);
	sort(a+2,a+n+1,[](point x,point y){return (x-a[1])*(y-a[1])>0;});
	cur=dis(a[1],a[2]),a[n+1]=a[1];
	for(int i=2;i<=n;i++)
		if(!chk(dis(a[i],a[i+1]),cur)) return 0;
	return 1;
}
int n,m,Q;
int main()
{
	scanf("%d%d%d",&n,&m,&Q);
	for(int i=1;i<=n;i++)
		p[i]=point{cos(i*PI*2/n),sin(i*PI*2/n)};
	for(int i=1,x,y,z;i<=m;i++)
	{
		scanf("%d%d%d",&x,&y,&z);
		p[i+n]=p[z]+p[x]-p[y];
	}
	while(Q--)
	{
		int k,x;
		scanf("%d",&k);
		for(int i=1;i<=k;i++) scanf("%d",&x),a[i]=p[x];
		puts(chk(k)?"Yes":"No");
	}
}