//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL,LL>
#define VE vector
#define VL VE<LL>
#define VP VE<PA>
#define VVL VE<VL>
#define VVVL VE<VVL>
#define PQ priority_queue
#define PQS priority_queue<LL,vector<LL>,greater<LL>>
#define FI first
#define SE second
#define PB push_back
#define POB pop_back
#define PF push_front
#define POF pop_front
#define MP make_pair
#define TS to_string
#define TU to_ullong
#define BPL __builtin_popcountll
#define FOR(i,a,n) for(i=a;i<n;++i)
#define FORR(i,a,n) for(i=n-1;i>=a;--i)
#define rep(i,n) FOR(i,0,n)
#define repr(i,n) FORR(i,0,n)
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define UB(a,n) *upper_bound(ALL(a),n)
#define UBn(a,n) upper_bound(ALL(a),n)-a.begin()
#define LB(a,n) *lower_bound(ALL(a),n)
#define LBn(a,n) lower_bound(ALL(a),n)-a.begin()
#define INF 1000000000000000003
#define PI 3.14159265358979323846264338327950288
//#define MOD 1000000007
#define MOD 998244353
#define ERR 1e-10
#define coutl cout<<fixed<<setprecision(15)
#define FAST cin.tie(0);ios::sync_with_stdio(false)

void Yn(LL a){if(a)cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void YN(LL a){if(a)cout<<"YES"<<endl;else cout<<"NO"<<endl;}
LL pwmn(LL a,LL n){LL ans=1;while(ans<a)ans*=n;return ans;}
LL dig(LL n){LL ret=0;while(n)n/=10,++ret;return ret;}
LL GCD(LL a,LL b){LL c=1,tmp=max(a,b);b=min(a,b);a=tmp;while(c!=0){c=a%b;a=b;b=c;}return a;}
LL LCM(LL a,LL b){return a*b/GCD(a,b);}
LL cmod(LL a,LL m){if(a%m<0)return a%m+abs(m);else return a%m;}
LL DIV(LL a,LL d,LL m){LL l=m,x=1,y=0,k;while(l){k=d/l;d-=k*l;swap(l,d);x-=k*y;swap(x,y);}return cmod(a*cmod(x,m),m);}
LL POW(LL a,LL n,LL m){LL ans=1;while(n>0){if(n&1)ans=ans*a%m;a=a*a%m;n>>=1;}return ans;}
VL fact,finv,inv;
void comi(LL n){LL i;fact.resize(max(2LL,n+1));finv.resize(max(2LL,n+1));inv.resize(max(2LL,n+1));fact[0]=fact[1]=1;finv[0]=finv[1]=1;inv[0]=inv[1]=1;FOR(i,2,n+1){fact[i]=fact[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}}
LL com(LL n,LL k){if(n<k||n<0||k<0)return 0;return fact[n]*(finv[k]*finv[n-k]%MOD)%MOD;}
bool cmps(PA a,PA b){if(a.SE!=b.SE)return a.SE<b.SE;return a.FI<b.FI;}
template<typename T>bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>void vout(VE<T> &v){LL i;rep(i,v.size()){cout<<v[i];if(i<v.size()-1)cout<<" ";}cout<<endl;}
template<typename T>void v2out(VE<VE<T>> &v){for(auto a:v)vout(a);}

int main(){
    FAST;
    LL i,j,b,ans=0,N,M,K,a;
    cin>>N>>M;
    VL A(M),B(M);
    rep(i,M){
        cin>>A[i]>>B[i];
        --A[i],--B[i];
    }
    cin>>K;
    VL C(K),D(K);
    rep(i,K){
        cin>>C[i]>>D[i];
        --C[i],--D[i];
    }
    rep(b,1<<K){
        a=0;
        VL v(N);
        rep(i,K){
            if((1<<i)&b)++v[C[i]];
            else ++v[D[i]];
        }
        rep(i,M)if(v[A[i]]&&v[B[i]])++a;
        chmax(ans,a);
    }
    
    cout<<ans<<endl;
}

#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define pb emplace_back
#define MP make_pair
using namespace std;
using ll = long long;
using ii = pair<int,int>;

const int maxn = 1000 + 5;
const int maxk = 16 + 5;

int G[maxn][maxn] = {};
int a[maxk][2];
int seq[maxk];
map<int,int> mp;
int ans = 0;

void dfs(int N, int ith){
    if(ith == N){
        int tmp = 0;
        vector<int> v;
        for(auto p : mp){
            if(p.second != 0) v.pb(p.first);
        }

        for(int i = 0; i < SZ(v); i++){
            for(int j = i+1; j < SZ(v); j++){
                if(G[v[i]][v[j]]){
//                    printf("[%d][%d], += %d\n", v[i], v[j], G[v[i]][v[j]]);
                    tmp += G[v[i]][v[j]];
                }
            }
        }
//        printf("%d\n", tmp);
        ans = max(ans, tmp);
        return;
    }
    for(int i = 0; i < 2; i++){
        mp[a[ith][i]]++;
        dfs(N, ith+1);
        mp[a[ith][i]]--;
    }
}

void solve(){
    int N, M;
    cin >> N >> M;
    for(int i = 0; i < M; i++){
        int a, b;
        cin >> a >> b;
        G[a][b]++;
        G[b][a]++;
    }
    int K;
    cin >> K;
    for(int i = 0; i < K; i++){
        cin >> a[i][0] >> a[i][1];
    }

    dfs(K, 0);
    cout << ans << '\n';
}

int main(){
    solve();
}
