#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

using namespace std;

#define cauto const auto&
#define ALL(v) begin(v),end(v)
#else
#define ALL(v) (v).begin(),(v).end()
#endif

namespace{
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}
template <class T> inline T &chmin(T &x, const T &y){ return x = min(x, y); }
template <class T> inline T &chmax(T &x, const T &y){ return x = max(x, y); }
template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}
template <class Con>
string concat(const Con &c, const string &spr){
	stringstream ss;
	typename Con::const_iterator it = c.begin(), en = c.end();
	bool fst = true;
	for(; it != en; ++it){
		if(!fst){ ss << spr; }
		fst = false;
		ss << *it;
	}
	return ss.str();
}

template <class Con, class Fun>
vector<typename Con::value_type> cfilter(const Con &c, Fun f) {
	vector<typename Con::value_type> ret;
	typename Con::const_iterator it = c.begin(), en = c.end();
	for(; it != en; ++it){
		if(f(*it)){
			ret.emplace_back(*it);
		}
	}
	return ret;
}
#if __cplusplus >= 201103L
template <class Con, class Fun>
auto cmap(const Con &c, Fun f) -> vector<decltype(f(*c.begin()))> {
	vector<decltype(f(*c.begin()))> ret;
	ret.reserve(c.size());
	for(const auto &x: c){
		ret.emplace_back(f(x));
	}
	return ret;
}
#endif

#if __cplusplus >= 201402L
#define lambda(e) ([&](const auto &_){ return (e); })
#define lambda2(e) ([&](const auto &_a, const auto &_b){ return (e); })
#endif


#define REP(i,n) for(int i=0;i<int(n);++i)
#define RALL(v) (v).rbegin(),(v).rend()
#define tget(t,i) get<i>(t)

#define MOD 1000000007LL
#define EPS 1e-8


void mainmain(){
	int n, m;
	cin >> n >> m;
	vint as(m), bs(m);
	REP(i, m){ cin >> as[i] >> bs[i]; }
	int k;
	cin >> k;
	vint cs(k), ds(k);
	REP(i, k){ cin >> cs[i] >> ds[i]; }
	int ans = 0;
	REP(S, 1 << k){
		vint v(n + 1);
		REP(i, k){
			v[S >> i & 1 ? cs[i] : ds[i]] = 1;
		}
		int cnt = 0;
		REP(i, m){
			if(v[as[i]] && v[bs[i]]){ ++cnt; }
		}
		chmax(ans, cnt);
	}
	cout << ans << '\n';
}



}
int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	cout << fixed << setprecision(10);
	cerr << fixed << setprecision(4);
	mainmain();
}

#include <bits/stdc++.h>
using namespace std;
std::map<long long,long long> s;
long long solve(long long x, long long y){
    if(s[y]>0) return s[y];
    if(y==1){
        s[y]=abs(x-y);
    }else if(y%2==1){
        s[y]=min(abs(x-y), min(solve(x,(y+1)/2)+2, solve(x, (y-1)/2)+2));
    }else{
        s[y]=min(abs(x-y), solve(x,y/2)+1);
    }
    return s[y];
}
long long act(long long dif, long long dim){
    long long a=0;
    for(long long i=0;i<dim;i++){
        a+=(dif>>i)&1;
    }
    a+= (dif>>dim);
    return a;
}
int solve_bin(long long x, long long y){
    if(x>=y){
        return x-y;
    }
    long long xd=x;
    long long dim;
    for(dim=0;dim<100;dim++){
        if(xd*2>=y)break;
        xd*=2;
    }
    long long a = act(y-xd, dim)+dim;
    long long b = act(xd*2-y, dim+1)+dim+1;
    return min(a,b);
}

int main(){
    long long x,y;
    cin >> x >> y;
    cout << solve(x,y) << endl;
    return 0;
}