#include<cstdio>

 #include<iostream>

 #include<algorithm>

 #include<cmath>

 #include<cstring>

 #include<cstdlib>

 #include<cctype>

 #include<stack>

 #include<queue>

 #include<vector>

 using namespace std;

 #define enter printf("\n")

 #define space printf(" ")

 #define Mem(a) memset(a, 0, sizeof(a))

 typedef long long ll;

 typedef double db;

 const int INF = 0x3f3f3f3f;

 const db eps = 1e-;

 const int maxn = 1e4 + ;

 inline ll read()

 {

     ll ans = ;

     char ch = getchar(), last = ' ';

     while(!isdigit(ch)) {last = ch; ch = getchar();}

     while(isdigit(ch))

     {

         ans = ans *  + ch - ''; ch = getchar();

     }

     if(last == '-') ans = -ans;

     return ans;

 }

 inline void write(ll x)

 {

     if(x < ) x = -x, putchar('-');

     if(x >= ) write(x / );

     putchar(x %  + '');

 }

 int t, n1, n2, n3;

 struct Edge

 {

     int from, to, cap, flow;

 };

 vector<Edge> edges;

 vector<int> G[maxn << ];

 void addEdge(int from, int to)

 {

     edges.push_back((Edge){from, to, , });

     edges.push_back((Edge){to, from, , });

     int sz = edges.size();

     G[from].push_back(sz - );

     G[to].push_back(sz - );

 }

 int dis[maxn << ];

 bool vis[maxn << ];

 bool bfs()

 {

     Mem(vis);

     queue<int> q;

     q.push(); vis[] = ;

     dis[] = ;

     while(!q.empty())

     {

         int now = q.front(); q.pop();

         for(int i = ; i < (int)G[now].size(); ++i)

         {

             Edge& e = edges[G[now][i]];

             if(!vis[e.to] && e.cap > e.flow)

             {

                 vis[e.to] = ;

                 dis[e.to] = dis[now] + ;

                 q.push(e.to);

             }

         }

     }

     return vis[t];

 }

 int cur[maxn << ];

 int dfs(int now, int a)

 {

     if(now == t || !a) return a;

     int flow = , f;

     for(int& i = cur[now]; i < (int)G[now].size(); ++i)

     {

         Edge& e = edges[G[now][i]];

         if(dis[e.to] == dis[now] +  && (f = dfs(e.to, min(a, e.cap - e.flow))) > )

         {

             e.flow += f;

             edges[G[now][i] ^ ].flow -= f;

             flow += f; a -= f;

             if(!a) break;

         }

     }

     return flow;

 }

 int maxflow()

 {

     int flow = ;

     while(bfs())

     {

         Mem(cur);

         flow += dfs(, INF);

     }

     return flow;

 }

 //bool vis2[maxn];

 int main()

 {

     n1 = read(); n2 = read(); n3 = read();

     t = (n1 << )+ n2 + n3 + ;                //为了防止编号重复

 /*按注释掉的写法会WA掉，因为如果一本书多次输入，那么这个书

 就多次拆点，这一本书就可以使用多次了 */

 /*    int m = read();

     while(m--)

     {

         int x = read(), y = read();

         addEdge(0, y + (n1 << 1));

         addEdge(y + (n1 << 1), x);

         addEdge(x, x + n1);

         vis2[x] = 1;

     }

     m = read();

     while(m--)

     {

         int x = read(), y = read();

         if(!vis2[x]) addEdge(x, x + n1), vis2[x] = 1;

         addEdge(x + n1, y + (n1 << 1) + n2);

         addEdge(y + (n1 << 1) + n2, t);

     }*/

     int m = read();

     while(m--)

     {

         int x = read(), y = read();

         addEdge(y + (n1 << ), x);

     }

     m = read();

     while(m--)

     {

         int x = read(), y = read();

         addEdge(x + n1, y + (n1 << ) + n2);

     }

     for(int i = ; i <= n1; ++i) addEdge(i, i + n1);

     for(int i = ; i <= n2; ++i) addEdge(, i + (n1 << ));

     for(int i = ; i <= n3; ++i) addEdge(i + (n1 << ) + n2, t);

     write(maxflow()); enter;

 }