#include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define REV(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
using namespace std;
int n, m;
#define MAXN 2005
struct ks{
int a, b, c;
};
struct user {
int a, b, c;
};
vector<ks> kses;
vector<user> users;
const int INF = 1e15;
int f[MAXN * 100];
void solve(){
cin >> n;
FOR(i, 1, n){
int a, b, c; cin >> a >> b >> c;
kses.push_back({a, b, c});
}
cin >> m;
FOR(i, 1, m){
int a, b, c; cin >> a >> b >> c;
users.push_back({a, b, c});
}
sort(kses.begin(), kses.end(), [](const ks &a, const ks &b){
return a.b > b.b;
});
sort(users.begin(), users.end(), [](const user &a, const user &b){
return a.b > b.b;
});
int ptr = 0;
FOR(i, 0, 100000) f[i] = -INF;
f[0] = 0;
int full = 0;
int res = 0;
for (user &i : users){
while (ptr < (int)kses.size() && kses[ptr].b >= i.b){
int val = kses[ptr].c;
int id = kses[ptr].a;
full += id;
for (int x = full; x >= id; --x){
f[x] = max(f[x], f[x - id] - val);
}
ptr++;
}
int val = i.c;
int id = i.a;
for (int x = 0; x <= full - id; ++x){
f[x] = max(f[x], f[x + id] + val);
}
}
for (int i = 0; i <= full; ++i) res = max(res, f[i]);
cout << res;
}
#define task "DATPHONG"
int32_t main(){
if (fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
solve();
return 0;
}
