#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define LL long long

#include <string>
const int Rea=1e5+3;
bool ifnum(char x){return x>='0'&&x<='9';}
bool ifupchr(char x){return x>='A'&&x<='Z';}
bool iflochr(char x){return x>='a'&&x<='z';}
bool ifchr(char x){return ifnum(x)||ifupchr(x)||iflochr(x);}
struct Rin
{
    char c;
    char gc()
    {
        static char rea[Rea];
        static char *head,*tail;
        return head==tail&&(tail=(head=rea)+fread(rea,1,Rea,stdin)
        ,head==tail)?EOF:*head++;
    }
    Rin&operator >>(int &x)
    {
        bool tag=false;x=0;
        for(c=gc();!ifnum(c);c=gc())if(c=='-'){c=gc();tag=true;break;}
        for(;ifnum(c);c=gc())x=(x<<1)+(x<<3)+(c^'0');if(tag)x=-x;return *this;
    }
    Rin&operator >>(LL &x)
    {
        bool tag=false;x=0;
        for(c=gc();!ifnum(c);c=gc())if(c=='-'){c=gc();tag=true;break;}
        for(;ifnum(c);c=gc())x=(x<<1)+(x<<3)+(c^'0');if(tag)x=-x;return *this;
    }
    Rin&operator >>(char &x)
    {
        for(c=gc();!ifchr(c);c=gc());
        x=c;
        return *this;
    }
    Rin&operator >>(string &x)
    {
        x.clear();
        for(c=gc();!ifchr(c);c=gc());
        for(;ifchr(c);c=gc())x.push_back(c);
        return *this;
    }
}rin;

const int N=1e4+3;
int n,m;

LL val;
LL a[65];
LL b[65];
void clear()
{
    val=0;
    for(int i=0;i<62;i++)a[i]=b[i]=0;
    return;
}
void insert(LL v,LL *f)
{
    for(int i=61;i>=0;i--)if((v>>i)&1)
    {
        if(f[i]>0)v^=f[i];
        else {f[i]=v;break;}
    }
    return;
}
void work()
{
    rin>>n>>m;
    clear();
    for(int i=1;i<=n;i++)
    {
        LL x,y;rin>>x>>y;
        val^=x;
        insert(x^y,a);
    }
    for(int i=1;i<=m;i++)
    {
        LL x,y;rin>>x>>y;
        val^=x;
        insert(x^y,b);
    }

    for(int i=61;i>=0;i--)
    {
        if(a[i]>0||b[i]>0)
        {
            if(a[i]>0&&b[i]>0)
            {
                if((val>>i)&1)
                {
                    val^=a[i];
                    insert(a[i]^b[i],a);
                }
                else insert(a[i]^b[i],a);
            }
            else
            {
                if(a[i]>0&&!((val>>i)&1))val^=a[i];
                else if(b[i]>0&&((val>>i)&1))val^=b[i];
            }
        }
    }
    printf("%lld\n",val);
}
int main()
{
    int T;rin>>T;
    for(;T-->0;)work();
    return 0;
}