#include<bits/stdc++.h>
#define fori(i,a,b) for(int i = a;i <= b; i++)
#define int long long
using namespace std;
typedef pair<int,int> ii;
typedef tuple<int,int,int> tp;
const int M = 1e5 + 10;
const int N = 2e3 + 10;
const int mod = 1e9 + 7;
int n , m ;
struct node
{
int c,f,v;
}buy[N],sell[N];
bool cmp(const node & a, const node & b) {
return a.f < b.f;
}
vector<int> f[N];
int kq = 0;
int g[M];
int upper[N];
void solve(int l,int r,int u,int v)
{
// cout << l << " " << r << " " << u << " " << v << "\n";
if(l >= r) return ;
int mid = (l + r)/2;
int lim = upper[mid+1];
solve(mid + 1,r,lim,v);
for(int i = 0; i<= f[mid +1].size() - 1; i++) g[i] = f[mid + 1][i];
int sum = f[mid + 1].size() - 1,i = mid;
// mat tien
for(int j = lim - 1;j >= upper[l] ; j--) {
sum += buy[j].c;
for(int e = sum;e >= buy[j].c ; e--) {
g[e] = max(g[e],g[e - buy[j].c] - buy[j].v);
}
if(upper[i] == j) {
// nhan tien
//cout << i << " " << l << " " << r << "root\n";
for(int e = 0;e <= f[i].size() - 1; e++) {
if(e + sell[e].c > sum) break;
f[i][e] = max(f[i][e],sell[i].v + g[e + sell[i].c]);
// cout << e + sell[i].c << " ";
// cout << e << " " << f[i][e] << "\n";
kq = max(f[i][e],kq);
//if(sell[i].v + g[e + sell[e].c] == 1800) cout << i << " " << e << " " << lim - 1 << " " << upper[l] << "\n";
}
i--;
}
}
for(int i = 0;i <= sum ; i++) g[i] = -1e15;
solve(l,mid,u,lim - 1);
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen("1.inp","r"))
{
freopen("1.inp","r",stdin);
freopen("1.out","w",stdout);
}
#define task ""
if(fopen(task".inp","r"))
{
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin >> n ;
for(int i = 1;i <= n ; i++) cin >> buy[i].c >> buy[i].f >> buy[i].v;
cin >> m;
for(int i = 1;i <= m ; i++) cin >> sell[i].c >> sell[i].f >> sell[i].v;
sort(buy + 1, buy + n + 1,cmp);
sort(sell + 1,sell + m + 1,cmp);
int j = n,sum = 0 ,idx = 0;
for(int i = m; i != 0; i--) {
while(sell[i].f <= buy[j].f && j != 0) sum += buy[j].c,j--;
f[i].assign(sum + 1,-1e15);
f[i][0] = 0;
upper[i] = j + 1;
if(upper[i] != n + 1 && idx == 0) idx = i;
}
for(int i = 1; i <= m ;i++) {
sum = 0;
//cout << i << "\n";
for(int j = n;j >= upper[i]; j--) {
sum += buy[j].c;
for(int e = sum; e >= buy[j].c; e--) {
f[i][e] = max(f[i][e],f[i][e - buy[j].c] - buy[j].v);
//cout << e << " " << f[i][e] << " " << buy[j].c << "\n";
}
}
for(int e = sell[i].c;e <= sum; e++) {
f[i][e - sell[i].c] = max(f[i][e - sell[i].c],f[i][e] + sell[i].v);
kq = max(kq,f[i][e - sell[i].c]);
}
//for(int e = 0;e <= f[i].size()-1; e++) cout << f[i][e] << " ";
// cout << endl;
// cout << kq << "\n";
}
for(int i = 1;i <= 100000; i++) g[i] = -1e15;
solve(1,idx,upper[1],n);
cout << kq;
}
