#include <bits/stdc++.h>
#define int long long
using namespace std;

void solve() {
	int n, m1, m2;
	cin >> n >> m1 >> m2;

	vector<array<int, 3>> a(m1 + m2 + 1);
	for (int i = 1; i <= m1 + m2; i++) {
		cin >> a[i][0] >> a[i][1] >> a[i][2];
	}

	auto check = [&](int v) -> bool {
		int s = n + 1;
		vector<vector<pair<int, int>>> adj(n + 2);
		for (int i = 1; i <= m1 + m2; i++) {
			auto [l, r, k] = a[i];
			if (i <= m1) {
				//s[r] - k >= s[l - 1]
				adj[r].push_back({l - 1, -k});
			} else {
				//s[l - 1] + v - k >= s[r]
				adj[l - 1].push_back({r, v - k});
			}
		}
		for (int i = 0; i <= n; i++) {
			adj[s].push_back({i, 0});
		}
		// s[i] <= min(i, v) + s[0]
		for (int i = 1; i <= n; i++) {
			adj[0].push_back({i, min(i, v)});
		}

		// cout << "? " << v << "\n";

		auto spfa = [&]() -> bool {
			vector<int> dis(n + 2, 1e9), vis(n + 2), inq(n + 2);
			dis[s] = 0;	
			vis[s] = 1;
			queue<int> q;
			q.push(s);
			while (q.size()) {
				int u = q.front();
				q.pop();
				vis[u] = 0;
				inq[u]++;
				if (inq[u] > n + 1) return false;
				for (auto [v, w] : adj[u]) {
					if (dis[u] + w < dis[v]) {
						dis[v] = dis[u] + w;
						if (!vis[v]) {
							vis[v] = 1;
							q.push(v);
						}
					}
				}
			}
			if (!is_sorted(dis.begin(), dis.begin() + n + 1)) return false;

			for (int i = 1; i <= n; i++) {
				dis[i] -= min(dis[0], 0LL);
			}
			dis[0] = max(0LL, dis[0]);

			return dis[n] <= v;
			// cout << v << "\n";
			// for (int i = 0; i <= n; i++) {
			// 	cout << dis[i] << " \n"[i == n];
			// }
			// return true;
		};

		return spfa();
	};

	int L = 0, R = n, ans = n;
	while (L <= R) {
		int mid = (L + R) / 2;
		if (check(mid)) {	
			ans = mid;
			R = mid - 1;
		} else {
			L = mid + 1;
		}
	}

	cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int T;
    cin >> T;
    while (T--) solve();

    return 0;
}