#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define PII pair<int,int>
namespace IO {
    #define gh getchar
    inline int read(){char ch=gh();int x=0;bool t=0;while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();return t?-x:x;}
    inline char getc(){char ch=gh();while(ch<'a'||ch>'z') ch=gh();return ch;}
    inline void write(int x){if(x < 0){putchar('-');x = -x;}if(x > 9){write(x / 10);}putchar((x % 10 + '0'));}
}
using namespace IO;
using namespace std;
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else                                               
	#define gdb(...) void()
	#endif
}using namespace Debug;
const int Maxn = 3010, mod = 1e9 + 7;
int n,m1,m2;
int f[Maxn]; vector<pair<int,int>> G[Maxn];
int l1[Maxn], r1[Maxn], k1[Maxn];
int l2[Maxn], r2[Maxn], k2[Maxn];
int num[Maxn];
bool check(int x){
    queue<int> q;
    bitset<Maxn> vis;
    memset(f,0x3f,sizeof f);
    memset(num,0,sizeof num);
    f[0]=0;q.push(0);vis[0]=1;
    while(!q.empty()){
        int u = q.front(); q.pop();
        num[u]++;
        if(num[u]>=n){
            return 0;
        }
        vis[u]=0;
        int v=0,w=0;
        for(auto [v,w] : G[u]){
            if(f[v]>f[u]+w){
                f[v]=f[u]+w;
                if(!vis[v]){
                    vis[v]=1;
                    q.push(v);
                }
            }
        }
    }
    return 1;
}
void work(){
    n = read(), m1 = read(), m2 = read();
    for(int i = 1; i <= m1; i++){
        l1[i] = read(), r1[i] = read(), k1[i] = read();
    }
    for(int i = 1; i <= m2; i++){
        l2[i] = read(), r2[i] = read(), k2[i] = read();
    }
    for(int i=0;i<=n;++i) G[i].clear();
    for(int i=1;i<=n;++i) G[i].pb({i-1,0});
    for(int i=1;i<=n;++i) G[i-1].pb({i,1});
    for(int i = 1; i <= m1; i++){
        G[r1[i]].pb({l1[i] - 1, -k1[i]});
    }
    int l = 0, r = n;
    int ans=0;
    while(l <= r){
        int mid = (l + r) >> 1;
        for(int i = 1; i <= m2; i++){
            G[l2[i]-1].pb({r2[i],mid-k2[i]});
        }
        G[0].pb({n,mid});G[n].pb({0,-mid});
        if(check(mid)){
            r = mid - 1, ans = mid;
        }else l = mid + 1;
        for(int i = 1; i <= m2; i++){
            G[l2[i]-1].pop_back();
        }
        G[0].pop_back();G[n].pop_back();
    }
    cout<< ans <<endl;
}
signed main(){
    int t = read();
    while(t--){
        work();
    }
}