#ifdef _WIN32
#  define LL "%I64d"
#else
#  define LL "%Ld"
#endif

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <algorithm>
#include <complex>
#include <utility>
#include <cassert>
using namespace std;
#define null NULL
#define mp make_pair
#define pb(a) push_back(a)
#define sz(a) ((int)(a).size())
#define all(a) a.begin() , a.end()
#define fi first
#define se second
#define relaxMin(a , b) (a) = min((a),(b))
#define relaxMax(a , b) (a) = max((a),(b))
#define SQR(a) ((a)*(a))
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef bitset<1010> base;
base act[160] , tmp;
vi part[1010];
int N , M , Q;
#define INF 100000000
int sp[160][160];
int main(){
  freopen("movie.in" , "r" , stdin);
  freopen("movie.out" , "w" , stdout);
  scanf("%d%d" , &N , &M);
  for(int i=0;i<M;++i){
   int cnt; scanf("%d" , &cnt);
   for(int j=0;j<cnt;++j){
    int use;
    scanf("%d" , &use) , --use;
    act[i][use] = true;
    part[use].pb(i);
                         }
                      }
  for(int i=0;i<M;++i)
   for(int j=i+1;j<M;++j){
    tmp = (act[i] & act[j]);
    if(tmp.any())sp[i][j] = sp[j][i] = 1;
    else sp[i][j] = sp[j][i] = INF;
                         }
  for(int m=0;m<M;++m)
   for(int i=0;i<M;++i)
    for(int j=0;j<M;++j)
     sp[i][j] = min(sp[i][j] , sp[i][m] + sp[m][j]);
  scanf("%d" , &Q);
  while(Q-- > 0){
   int a , b;
   scanf("%d%d" , &a , &b);
   --a , --b;
   if(a == b)printf("%d\n" , 0);
   else{
    int best = INF;
    for(int lo=0;lo<sz(part[a]);++lo)
     for(int hi=0;hi<sz(part[b]);++hi)
      relaxMin(best , sp[part[a][lo]][part[b][hi]]);
    if(best == INF)printf("%d\n" , -1);
    else printf("%d\n" , best+1);
       }
                }
  return 0;
}