#include "bits/stdc++.h"
#define int long long
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
struct sth {
int c, f, v;
};
const int N = 4003;
const int MX = 2000 * 50 + 1;
sth a[N];
int pd[MX];
int dp[MX];
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
int c, f, v;
cin >> c >> f >> v;
a[i] = {c, f, -v};
}
int m;
cin >> m;
for (int i = 1; i <= m; ++i) {
int c, f, v;
cin >> c >> f >> v;
a[i + n] = {-c, f, v};
}
sort(a + 1, a + n + m + 1, [&](const sth& x, const sth& y) {
return (x.f == y.f ? x.c > y.c : x.f > y.f);
});
fill(pd + 1, pd + MX, -1e15);
for (int i = 1; i <= n + m; ++i) {
auto [c, f, v] = a[i];
for (int j = 0; j < MX; ++j) {
dp[j] = pd[j];
}
if (c < 0) {//order
for (int j = 0; j - c < MX; ++j) {
dp[j] = max(dp[j], pd[j - c] + v);
}
} else {
for (int j = c; j < MX; ++j) {
dp[j] = max(dp[j], pd[j - c] + v);
}
}
for (int j = 0; j < MX; ++j) {
pd[j] = dp[j];
}
}
int ans = 0;
for (int i = 0; i < MX; ++i) {
ans = max(ans, dp[i]);
}
cout << ans << '\n';
return 0;
}
