#include <bits/stdc++.h>

using namespace std;
const int N = 3000;
const int M = 3000;

int n, m1, m2, dis[N + 1], cnt[N + 1];
array<int, 3> p1[M + 1], p2[M + 1];
vector<pair<int, int>> edge[N + 1];
queue<int> que;
bool inq[N + 1];

bool SPFA() {
	for (int i = 1; i <= n; i++)
		dis[i] = 1 << 30, inq[i] = false;
	dis[0] = cnt[0] = 0;
	que.push(0), inq[0] = true;
	while (!que.empty()) {
		int node = que.front();
		que.pop(), inq[node] = false;
		for (auto i : edge[node])
			if (dis[i.first] > dis[node] + i.second) {
				dis[i.first] = dis[node] + i.second;
				cnt[i.first] = cnt[node] + 1;
				if (cnt[i.first] >= n + 1)
					return false;
				else if (!inq[i.first])
					que.push(i.first), inq[i.first] = true;
			}
	}
	return true;
}

bool judge(int num) {
	for (int i = 0; i <= n; i++)
		edge[i].clear();
	for (int i = 1; i <= m1; i++) {
		int u = p1[i][0], v = p1[i][1], w = p1[i][2];
		edge[v].push_back({u - 1, -w});
	}
	for (int i = 1; i <= m2; i++) {
		int u = p2[i][0], v = p2[i][1], w = p2[i][2];
		edge[u - 1].push_back({v, num - w});
	}
	for (int i = 1; i <= n; i++) {
		edge[i].push_back({i - 1, 0});
		edge[i - 1].push_back({i, 1});
	}
	return SPFA();
}

int main() {
	int test = 1;
	scanf("%d", &test);
	while (test--) {
		scanf("%d%d%d", &n, &m1, &m2);
		for (int i = 1; i <= m1; i++)
			for (int j = 0; j < 3; j++)
				scanf("%d", &p1[i][j]);
		for (int i = 1; i <= m2; i++)
			for (int j = 0; j < 3; j++)
				scanf("%d", &p2[i][j]);
		int l = 0, r = n + 1;
		while (l + 1 < r) {
			int mid = (l + r) / 2;
			if (!judge(mid))
				l = mid;
			else
				r = mid;
		}
		printf("%d\n", r);
	}
	return 0;
}