#include<bits/stdc++.h>
using namespace std;
const int N=2e5+7;
const int mod=10000;
int father[N];
map<int,int>vis;
int find(int x){
if(x==father[x]) return x;
return father[x]=find(father[x]);
}
void compare(int a,int b){
int dx=find(a);
int dy=find(b);
if(dx!=dy) father[dx]=dy;
}
int main(){
for(int i=1;i<=30000;i++) father[i]=i;
int n;
cin>>n;
int sum=INT_MIN;
for(int i=1;i<=n;i++){
int m;
cin>>m;
for(int j=1;j<=m;j++){
int x;cin>>x;
compare(x,i+mod);
sum=max(sum,x);
}
}
for(int i=1;i<=sum;i++){
int d=find(i);
vis[d]++;
}
cout<<sum<<" "<<vis.size()<<endl;
int q;
cin>>q;
while(q--){
int a,b;
cin>>a>>b;
if(find(a)!=find(b)) cout<<"N"<<endl;
else cout<<"Y"<<endl;
}
return 0;
}