#include<cstdio>

 #include<vector>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 const int N=,M=,inf=1e9;

 int p[N],from[M],noww[M],goal[M],flw[M],flow[M];

 int a[N],b[N],pp[N],ch[N],dep[N],que[N];

 int T,n,m,s,t,fr,bk,q,t1,t2,cnt,ans;

 vector<int> ve[N];

 vector<int> ::iterator it;

 bool Odd(int x){return x&;}

 bool Even(int x){return !(x&);}

 int Bitcount(int x)

 {

     int ret=;

     while(x)

         ret++,x-=x&-x;

     return ret;

 }

 void Link(int f,int t,int v)

 {

     noww[++cnt]=p[f],p[f]=cnt,from[cnt]=f;

     goal[cnt]=t,flw[cnt]=flow[cnt]=v;

     noww[++cnt]=p[t],p[t]=cnt,from[cnt]=t;

     goal[cnt]=f,flw[cnt]=flow[cnt]=;

 }

 bool Layering(int st,int ed)

 {

     for(int i=;i<=ed;i++)

         pp[i]=p[i],dep[i]=-;

     dep[st]=,que[fr=bk=]=st;

     while(fr<=bk)

     {

         int tn=que[fr++];

         for(int i=pp[tn];i;i=noww[i])

             if(ch[from[i]]&&ch[goal[i]])

                 if(dep[goal[i]]==-&&flow[i])

                     dep[goal[i]]=dep[tn]+,que[++bk]=goal[i];

     }

     return ~dep[ed];

 }

 int Augmenting(int nd,int ed,int mn)

 {

     if(nd==ed||!mn) return mn;

     int tmp=,tep=;

     for(int i=pp[nd];i;i=noww[i])

         if(ch[from[i]]&&ch[goal[i]])

         {

             pp[nd]=i;

             if(dep[goal[i]]==dep[nd]+)

                 if(tep=Augmenting(goal[i],ed,min(mn,flow[i])))

                 {

                     flow[i]-=tep,mn-=tep;

                     flow[i^]+=tep,tmp+=tep;

                     if(!mn) break;

                 }

         }

     return tmp;

 }

 int Dinic_Maxflow(int st,int ed)

 {

     int ret=;

     while(Layering(st,ed))

         ret+=Augmenting(st,ed,inf);

     return ret;

 }

 int main()

 {

     register int i,j,k;

     scanf("%d",&T);

     while(T--)

     {

         scanf("%d%d%d",&n,&m,&q),ans=;

         for(i=;i<=n;i++) ve[i].clear();

         for(i=;i<=n;i++) scanf("%d",&a[i]);

         for(i=;i<=m;i++) scanf("%d",&b[i]);

         for(i=;i<=q;i++)

             scanf("%d%d",&t1,&t2),ve[t1].push_back(t2);

         cnt=,s=m+,t=s+;

         for(i=;i<=m+;i++) ch[i]=,p[i]=;

         for(i=;i<=m;i++)

             for(j=i+;j<=m;j++)

                 if(Odd(b[i]^b[j])&&Even(Bitcount(b[i]|b[j])))

                     Odd(b[i])?Link(i,j,):Link(j,i,);

         for(i=;i<=m;i++)

             Odd(b[i])?Link(s,i,):Link(i,t,);

         ans=max(ans,m-Dinic_Maxflow(s,t));

         for(i=;i<=n;i++)

         {

             int tmp=;

             for(j=;j<=m;j++) ch[j]=;

             for(j=;j<=cnt;j++) flow[j]=flw[j];

             for(it=ve[i].begin();it!=ve[i].end();it++) tmp++,ch[*it]=;

             ans=max(ans,tmp-Dinic_Maxflow(s,t)+);

         }

         for(i=;i<=n;i++)

             for(k=i+;k<=n;k++)

                 if(Odd(a[i]^a[k]))

                 {

                     int tmp=;

                     for(j=;j<=m;j++) ch[j]=;

                     for(j=;j<=cnt;j++) flow[j]=flw[j];

                     for(it=ve[i].begin();it!=ve[i].end();it++) ch[*it]++;

                     for(it=ve[k].begin();it!=ve[k].end();it++) ch[*it]++;

                     for(j=;j<=m;j++) ch[j]==?tmp++,ch[j]=:ch[j]=;

                     ans=max(ans,tmp-Dinic_Maxflow(s,t)+);

                 }

         printf("%d\n",ans);

     }

     return ;

 }