#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <stack>
#include <limits.h>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <cstring>
#include <sstream>
#pragma GCC target("popcnt")
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD=1e9+7;
typedef pair<ll,ll>point;
//#define x first
//#define y second
struct E{
int cores;
int hz;
int money;
};
int n,m;
E computers[2000];
E people[2000];
bool cmp(E&a,E&b){
return a.hz>b.hz;
}
ll dp[300][300][300];
bool dpt[300][300][300];
ll get(int c,int p,int cores){
if(dpt[c][p][cores])
return dp[c][p][cores];
ll res=0;
if(p==m)
res=0;
else if(c==n){
res=get(c,p+1,cores);
if(people[p].cores<=cores)
res=max(res,get(c,p+1,cores-people[p].cores)+people[p].money);
}else{
res=max(res,get(c+1,p,cores));
res=max(res,get(c,p+1,cores));
if(people[p].cores<=cores)
res=max(res,get(c,p+1,cores-people[p].cores)+people[p].money);
if(computers[c].hz>=people[p].hz&&cores+computers[c].cores<100)
res=max(res,get(c+1,p,cores+computers[c].cores)-computers[c].money);
}
dpt[c][p][cores]=true;
dp[c][p][cores]=res;
return res;
}
int main(){
ios::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
//freopen("speeding.in","r",stdin);
//freopen("speeding.out","w",stdout);
cin>>n;
for(int i=0;i<n;i++)
cin>>computers[i].cores>>computers[i].hz>>computers[i].money;
cin>>m;
for(int i=0;i<m;i++)
cin>>people[i].cores>>people[i].hz>>people[i].money;
sort(computers,computers+n,cmp);
sort(people,people+m,cmp);
cout<<get(0,0,0)<<"\n";
return 0;
}
/*
4
4 2200 700
2 1800 10
20 2550 9999
4 2000 750
3
1 1500 300
6 1900 1500
3 2400 4550
*/
