#include <bits/stdc++.h>
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;

#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

void solve() {
    int n, m1, m2;
    cin >> n >> m1 >> m2;
    vector<int> p(m1 + m2);
    vector<vector<bool>> ch(m1 + m2, vector<bool>(n, false));
    for (int i = 0, l, r, k; i < m1; ++i) {
        cin >> l >> r >> k;
        --l, --r;
        p[i] = k;
        for (int j = l; j <= r; ++j)
            ch[i][j] = 1;
    }
    for (int i = 0, l, r, k; i < m2; ++i) {
        cin >> l >> r >> k;
        --l, --r;
        p[i + m1] = k;
        for (int j = 0; j < n; ++j)
            if (j < l || j > r)
                ch[i + m1][j] = 1;
    }
    vector<int> cnt(n, 0);
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m1 + m2; ++j)
            if (p[j] != 0)
                cnt[i] += ch[j][i];
    int ans = 0;
    set<pair<int, int>> val;
    for (int i = 0; i < n; ++i)
        val.insert({cnt[i], i});
    set<int> l;
    for (int i = 0; i < m1 + m2; ++i)
        if (p[i] != 0)
            l.insert(i);
    while (l.size()) {
        ++ans;
        auto v = prev(val.end())->second;
        val.erase(prev(val.end()));
        for (int j = 0; j < m1 + m2; ++j)
            if (ch[j][v]) {
                --p[j];
                if (p[j] == 0) {
                    l.erase(j);
                    for (int q = 0; q < n; ++q)
                        if (ch[j][q]) {
                            auto it = val.find({cnt[q], q});
                            if (it != val.end()) {
                                val.erase(it);
                                --cnt[q];
                                val.insert({cnt[q], q});
                            }
                        }
                }
            }
    }
    cout << ans << '\n';
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--)
        solve();
}