#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,m,q;
cin>>n>>m>>q;
vector<int>vct[n+1];
while(m--){
int u,v;
cin>>u>>v;
vct[max(v,u)].push_back(min(u,v));
}
while(q--){
int ans=-1;
vector<bool>v(n+1,1);
int a;
cin>>a;
deque<pair<int,int>>dq={{a,0}};
int k;
cin>>k;
while(k--){
cin>>a;
v[a]=0;
}
while(dq.size()){
a=dq.front().first;
int b=dq.front().second;
dq.pop_front();
if(v[a])ans=max(ans,b);
for(auto &i:vct[a])dq.push_back({i,b+1});
}
cout<<ans<<endl;
}
}
