#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }



const int MAX_UF = 1000;
struct UnionFind {    
    int size_;
    int par[MAX_UF];
    int rank[MAX_UF];
    
    UnionFind(int n = 0) {size_ = n; for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;}
    void init(int n) {size_ = n; for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;}
    int root(int x) {return par[x] == x ? x : par[x] = root(par[x]);}    
    bool same(int x, int y) {return root(x) == root(y);}
    friend ostream& operator << (ostream& s, UnionFind uf) {return s << uf.group();}
    
    void connect(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return;        
        if (rank[x] < rank[y]) par[x] = y;
        else {par[y] = x; if (rank[x] == rank[y]) ++rank[x];}
    }
    
    vector<vector<int> > group() {
        vector<vector<int> > res;        
        vector<bool> fixed(size_, false);
        for (int i = 0; i < size_; ++i) {
            if (!fixed[i]) {
                vector<int> temp;
                for (int j = i; j < size_; ++j) {
                    if (same(i, j)) temp.push_back(j), fixed[j] = true;
                }
                res.push_back(temp);
            }
        }
        return res;
    }
} uf;


int N, K, R;
int m, b, p, q;

int main() {
    while (cin >> N >> K) {
        uf.init(N);
        for (int i = 0; i < K; ++i) {
            cin >> m;
            int fi = -1;
            for (int j = 0; j < m; ++j) {
                cin >> b;
                --b;
                if (fi != -1) uf.connect(fi, b);
                fi = b;
            }
        }
        cin >> R;
        
        bool bad[1000];
        memset(bad, 0, sizeof(bad));
        for (int i = 0; i < R; ++i) {
            cin >> p >> q;
            --p; --q;
            if (uf.same(p, q)) bad[p] = bad[q] = true;
        }
    
        int res = 0;
        for (int i = 0; i < N; ++i) if (bad[i]) ++res;
        
        cout << res << endl;
    }
    
    return 0;
}


Measured memory_bytes: 1164