include[HTML_REMOVED]
using namespace std;
int n,m,p[100010];
bool ans[10010],v[100010];
int find(int x)
{
if(p[x]!=x) p[x]=find(p[x]);
return p[x];
}
int main()
{
int num=0,k=0,e=0;
cin>>n;
for(int i=1;i<=100010;i) p[i]=i;
for(int i=1;i<=n;i)
{
int b[15],x;
cin>>x>>b[1];
if(!v[b[1]])
{
k;
v[b[1]]=1;
}
num;
for(int i=2;i<=x;i)
{
num;
cin>>b[i];
if(!v[b[i]])
{
k;
v[b[i]]=1;
}
p[find(b[i])]=find(b[i-1]);
}
}
memset(v,0,sizeof(v));
for(int i=1;i<=k;i)
if(!v[find(i)])
{
e;
v[find(i)]=1;
}
cin>>m;
for(int i=1;i<=m;i)
{
int x,y;
cin>>x>>y;
if(find(x)==find(y)) ans[i]=1;
}
cout<<e<<’ ‘<<k<<endl;
for(int i=1;i<=m;i++)
{
if(ans[i]) cout<<”Yes”<<endl;
else cout<<”No”<<endl;
}
return 0;
}