/*70分 被卡T*/

#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

int a[],b[],na,nb,m,head[],num;

int T1,T2,ban[],Link[],vis[],tim[],T;

bool map[][];

struct node{int to,pre;}e[];

void Insert(int from,int to){

    e[++num].to=to;

    e[num].pre=head[from];

    head[from]=num;

}

int count(int x){

    int res=;

    while(x){

        res+=x&;

        x>>=;

    }

    return res;

}

bool find(int x){

    if(ban[x]==T1)return ;

    for(int i=head[x];i;i=e[i].pre){

        int to=e[i].to;

        if((ban[to]!=T1)&&(vis[to]!=T2)){

            vis[to]=T2;

            if(tim[to]!=T1||!Link[to]||find(Link[to])){

                tim[to]=T1;

                Link[to]=x;

                return ;

            }

        }

    }

    return ;

}

int mis(int x=,int y=){

    T1++;int res=;

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

        if(map[x][i]||map[y][i])ban[i]=T1,res++;

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

        if(b[i]&){

            T2++;

            if(find(i))res++;

        }

    return nb-res;

}

int main(){

    freopen("friends.in","r",stdin);freopen("friends.out","w",stdout);

    scanf("%d",&T);

    while(T--){

        memset(map,,sizeof(map));

        memset(head,,sizeof(head));

        memset(Link,,sizeof(Link));

        memset(ban,,sizeof(ban));

        memset(tim,,sizeof(tim));

        memset(vis,,sizeof(vis));

        num=;T1=;T2=;

        scanf("%d%d%d",&na,&nb,&m);

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

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

        int x,y;

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

            scanf("%d%d",&x,&y);

            map[x][y]=;

        }

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

            for(int j=i;j<=nb;j++){

                if(((b[i]^b[j])%==)&&(count(b[i]|b[j])%==))

                Insert(i,j),Insert(j,i);

            }

        for(int i=;i<=nb;i++)map[][i]=;

        int ans=mis();

        for(int i=;i<=na;i++)ans=max(ans,mis(i)+);

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

            for(int j=;j<=na;j++)

                if((a[i]^a[j])%==)ans=max(ans,mis(i,j)+);

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

    }

    return ;

}