#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i = a; i <= b; ++i)
#define pb push_back
#define mp make_pair
const int N = 3020;
bool vis[N];
int cnt[N];
int dis[N];
int q[N];
class spfa{
	private: 
		int n;
		vector<vector<pair<int,int>>> To;
		int head,tail;
	public:
		spfa(int siz = 0){
			n = siz;
			To.resize(n + 1);
			head = 0,tail = -1;
			For(i,0,n) {
				cnt[i] = dis[i] = 0;
				vis[i] = false;
			}
		}
		void Add(int u,int v,int w){
			To[u].pb(mp(v,w));
		}
		const int inf = 1e9;
		int Spfa(){
			
			For(i,0,n){
				q[++tail] = i;
				vis[i] = 1;
				cnt[i]++;
			}
			while(head <= tail){
				int u = q[head++];
				if(cnt[u] > n+2) 
					return 1;
				vis[u] = 0;
				for(auto &arr : To[u]){
					if(dis[arr.first] > dis[u] + arr.second ){
						dis[arr.first] = dis[u] + arr.second;
						if(!vis[arr.first]){
							cnt[arr.first]++;
							vis[arr.first] = 1;
							q[++tail] = arr.first;
						}
					}
				}
			}
			return 0;
		}
};
inline int read(){
	int x=0;
	bool f=false;
	char ch=getchar();
	while(!isdigit(ch))f=ch=='-',ch=getchar();
	while(isdigit(ch))x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return f?-x:x;
}
vector<pair<pair<int,int>,int>> Rule1;
vector<pair<pair<int,int>,int>> Rule2;
bool Judge(int n,int v){
	spfa M  = spfa(n + 1);
	M.Add(0,n,v);
	// sum[n] - sum[0] <= v;
	M.Add(n,0,-v);
	// sum[n] - sum[0] >= v;
	For(i,1,n){
		M.Add(i-1,i,1);
		M.Add(i,i-1,0);
	}
	for(auto &tmp : Rule1){
		int l = tmp.first.first;
		int r = tmp.first.second;
		int k = tmp.second;
		// greater
		M.Add(r,l-1,-k);
	}
	for(auto &tmp : Rule2){
		int l = tmp.first.first;
		int r = tmp.first.second;
		int k = tmp.second;
		// smaller
		M.Add(l - 1,r,v - k);
	}
	if(M.Spfa())
		return 0;
	return 1;
}
signed main(){
#ifdef NICEGUODONG
	freopen("data.in","r",stdin);
#endif
//	ios::sync_with_stdio(false);
	int T;
	T =read();
	while(T--){
		int n,m1,m2;
		Rule1.clear(),Rule2.clear();
		n = read() , m1 = read(), m2 = read();
		For(i,1,m1){
			int l,r,k;
			l = read() , r = read() , k = read();
			auto tmp = mp(mp(l,r),k);
			Rule1.pb(tmp);
		}
		For(i,1,m2){
			int l,r,k;
			l = read() , r = read() , k = read();
			auto tmp = mp(mp(l,r),k);
			Rule2.pb(tmp);
		}
		int l = 0,r = n,ans = 0;
		while(l <= r){
			int mid = (l + r) >> 1;
			if(Judge(n,mid)){
				r = mid - 1;
				ans = mid;
			}
			else{
				l = mid + 1;
			}
		}
		printf("%d\n",ans);
	}
}