#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

bool chmin(i64 &a, i64 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

void solve() {
    int N, M1, M2;
    std::cin >> N >> M1 >> M2;
    
    std::vector<int> L(M1 + M2), R(M1 + M2), K(M1 + M2);
    for (int i = 0; i < M1 + M2; i++) {
        std::cin >> L[i] >> R[i] >> K[i];
        L[i]--;
    }
    
    int lo = 0, hi = N;
    while (lo < hi) {
        int x = (lo + hi) / 2;
        
        std::vector<i64> f(N + 1);
        int lst = -1;
        for (int t = 0; t <= N; t++) {
            for (int i = 0; i < M1 + M2; i++) {
                if (i < M1) {
                    if (chmin(f[L[i]], f[R[i]] - K[i])) {
                        lst = t;
                    }
                } else {
                    if (chmin(f[R[i]], f[L[i]] + x - K[i])) {
                        lst = t;
                    }
                }
            }
            for (int i = N - 1; i >= 0; i--) {
                if (chmin(f[i], f[i + 1])) {
                    lst = t;
                }
            }
            if (chmin(f[N], f[0] + x)) {
                lst = t;
            }
            if (chmin(f[0], f[N] - x)) {
                lst = t;
            }
        }
        if (lst == N) {
            lo = x + 1;
        } else {
            hi = x;
        }
    }
    
    std::cout << lo << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int T;
    std::cin >> T;
    
    while (T--) {
        solve();
    }
    
    return 0;
}