#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 3e5;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 998244353;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
struct node {
int cnt, pow, cost, ty;
};
bool cmp(node x, node y){
return x.pow > y.pow;
}
void chmn(int &a, int b){
a = min(a, b);
}
void chmx(int &a, int b){
a = max(a, b);
}
int n, m;
vector <node> vec;
int dp[MAXN+30];
signed main(){
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for(int i=1; i<=n; i++){
int x, y, z; cin >> x >> y >> z;
node nw; nw.cnt = x; nw.pow = y; nw.cost = z; nw.ty = 1;
vec.pb(nw);
}
cin >> m;
for(int i=1; i<=m; i++){
int x, y, z; cin >> x >> y >> z;
node nw; nw.cnt = x; nw.pow = y; nw.cost = z; nw.ty = 0;
vec.pb(nw);
}
sort(vec.begin(), vec.end(), cmp);
for(int i=1; i<=MAXN; i++) dp[i] = -INF;
int ANS = 0;
for(auto in : vec){
int cnt = in.cnt, pow = in.pow, cost = in.cost, ty = in.ty;
// cout << cnt << ' ' << pow << ' ' << cost << ' ' << ty << " pp\n";
if(ty){ // upd
for(int i=MAXN; i>=1; i--){
chmx(dp[i], dp[max(0ll, i-cnt)]-cost);
}
} else { // mx
for(int i=0; i<=MAXN; i++){
if(i+cnt<=MAXN) chmx(dp[i], dp[i+cnt]+cost);
}
}
for(int i=1; i<=MAXN; i++) chmx(ANS, dp[i]);
}
// cout << "mn\n";
// for(int i=1; i<=20; i++) cout << mn[i] << " \n"[i==20];
// for(int i=1; i<=20; i++) cout << mx[i] << " \n"[i==20];
cout << ANS << '\n';
}
