#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
ll bit(int x){return 1ll<<x;}
int n,m;
struct linerbase{
	ll p[61];
	void clear(){for(int i=0;i<=60;i++)p[i]=0;}
	void ins(ll x){
		for(int i=60;~i;--i)
			if(bit(i)&x){
				if(p[i])x^=p[i];
				else{
					p[i]=x;
					break;
				}
			}
	}
	ll qmx(ll x){
		for(int i=60;~i;--i)
			if(bit(i)&x);
			else x^=p[i];
		return x;
	}
	ll qmn(ll x){
		for(int i=60;~i;--i)
			if(bit(i)&x)x^=p[i];
		return x;
	}
}A,B,C;
void solve(){
	read(n,m);
	ll s=0;A.clear();B.clear();C.clear();
	for(int i=1;i<=n;i++){
		ll x,y;read(x,y);
		s^=x;
		A.ins(x^y);
	}
	for(int i=1;i<=m;i++){
		ll x,y;read(x,y);
		s^=x;
		B.ins(x^y);
	}
	for(int i=0;i<=60;i++)
		if(A.p[i])
			C.ins(B.qmn(A.p[i]));
	cout<<C.qmx(B.qmn(s))<<'\n';
}
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	int T;read(T);
	while(T--)solve();
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}