#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME (1.0 * clock() / CLOCKS_PER_SEC)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int N = 2e3 + 5, CORE = 50;
const int oo = 1e18, mod = 1e9 + 7;
int n, m, dp[CORE * N];
vector<array<int, 4>> q;
void process() {
cin >> n;
foru(i, 1, n) {
int c, f, v;
cin >> c >> f >> v;
q.pb({f, 1ll, c, -v});
}
cin >> m;
foru(i, 1, m) {
int C, F, V;
cin >> C >> F >> V;
q.pb({F, 0ll, C, V});
}
memset(dp, -0x3f, sizeof(dp));
dp[0]=0ll;
sort(q.rbegin(), q.rend());
for (auto cmp : q) {
if (cmp[1]) {
ford(i, CORE, cmp[2]) {
dp[i] = max(dp[i], dp[i - cmp[2]] + cmp[3]);
}
} else {
foru(i, 0, CORE) {
dp[i] = max(dp[i], dp[i + cmp[2]] + cmp[3]);
}
}
}
int ans=*max_element(dp, dp+CORE*N-1);
cout << max(0ll, ans) << '\n';
return;
}
signed main() {
cin.tie(0)->sync_with_stdio(false);
//freopen(".inp", "r", stdin);
//freopen(".out", "w", stdout);
process();
cerr << "Time elapsed: " << __TIME << " s.\n";
return 0;
}
// dont stop
