#include<bits/stdc++.h>

#define ll long long

using namespace std;

const int N=40010,INF=1e9;

int link[N],tot=1,n1,n2,n3,s,t,d[N],current[N],m1,m2;

struct edge{int y,v,next;}a[N*1000];

inline int read()

{

    int x=0,ff=1;

    char ch=getchar();

    while(!isdigit(ch)) {if(ch=='-') ff=-1;ch=getchar();}

    while(isdigit(ch)) {x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}

    return x*ff;

}

inline void add(int x,int y,int v)

{

    a[++tot].y=y;a[tot].v=v;a[tot].next=link[x];link[x]=tot;

    a[++tot].y=x;a[tot].v=0;a[tot].next=link[y];link[y]=tot;

}

inline bool bfs()

{

    queue<int>q;q.push(s);

    memset(d,0,sizeof(d));

    memcpy(current,link,sizeof(current));

    d[s]=1;

    while(!q.empty())

    {

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

        for(int i=link[x];i;i=a[i].next)

        {

            int y=a[i].y;

            if(d[y]||!a[i].v) continue;

            d[y]=d[x]+1;

            q.push(y);

            if(y==t) return true;

        }

    }

    return false;

}

inline int dinic(int x,int flow)

{

    if(x==t) return flow;

    int rest=flow,k;

    for(int i=current[x];i&&rest;i=a[i].next)

    {

        current[x]=i;

        int y=a[i].y;

        if(d[y]==d[x]+1&&a[i].v)

        {

            k=dinic(y,min(rest,a[i].v));

            if(!k) d[y]=0;

            a[i].v-=k;

            a[i^1].v+=k;

            rest-=k;

        }

    }

    return flow-rest;

}

int main()

{

    freopen("1.in","r",stdin);

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

    //书：1 - 2*n1,练习册：2*n1+1 - 2*n1+n2,答案：2*n1+n2+1 - 2*n1+n2+n3.

    s=0;t=n1*2+n2+n3+1;

    m1=read();

    for(int i=1;i<=m1;++i)

    {

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

        add(y+n1*2,x,1);

    }

    m2=read();

    for(int i=1;i<=m2;++i)

    {

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

        add(x+n1,y+n1*2+n2,1);

    }

    for(int i=1;i<=n1;++i) add(i,i+n1,1);

    for(int i=1;i<=n2;++i) add(s,n1*2+i,1);

    for(int i=1;i<=n3;++i) add(n1*2+n2+i,t,1);

    int maxflow=0,flow;

    while(bfs())

        while(flow=dinic(s,INF)) maxflow+=flow;

    printf("%d",maxflow);

    return 0;

}