// Success consists of going from failure to failure without loss of enthusiasm
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define pb push_back
using ll = long long;
template<class T> using V = vector<T>;
using vi = V<int>;
using vl = V<ll>;
const ll INF = ll(1e15) + 10;
int main() {
cin.tie(0)->sync_with_stdio(0);
int N; cin >> N;
V<array<int, 4>> A;
for(int i = 0; i < N; i++) {
int c, f, v; cin >> c >> f >> v;
A.pb({f, 1, c, v});
}
int M; cin >> M;
for(int i = 0; i < M; i++) {
int c, f, v; cin >> c >> f >> v;
A.pb({f, -1, c, v});
}
sort(begin(A), end(A));
const int nax = N * 50 + 5;
vl dp(nax, -INF); dp[0] = 0;
for(int i = 0; i < N + M; i++) {
if (A[i][1] == -1) {
int c = A[i][2], v = A[i][3];
for(int x = nax - 1; x >= 0; x--) if (dp[x] != -INF) {
int y = x + c;
if (y < nax) dp[y] = max(dp[x] + v, dp[y]);
}
} else {
int c = A[i][2], v = A[i][3];
for(int x = 0; x < nax; x++) if (dp[x] != -INF) {
int y = max(x - int(c), 0);
dp[y] = max(dp[x] - v, dp[y]);
}
}
}
cout << dp[0] << nl;
return 0;
}
