#include <bits/stdc++.h>
using namespace std;
#define name "code"
#define MAXN 200005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
u+=v;
if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
u-=v;
if (u<0) u+=MOD;
}
void minimize(int &u, int v){
u=min(u,v);
}
void maximize(ll &u, ll v){
u=max(u,v);
}
long long Rand(long long l, long long r){
ll tmp=0;
FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
return l+tmp%(r-l+1);
}
int n,m;
struct Node{
int x,y,z;
int type;
bool operator<(const Node &other) const{
return y>other.y;
}
}a[MAXN];
ll dp[MAXN];
int main()
{
// freopen(name".inp","r",stdin);
// freopen(name".out","w",stdout);
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int sum=0;
cin>>n;
FOR(i,1,n){
cin>>a[i].x>>a[i].y>>a[i].z;
a[i].type=1;
sum+=a[i].x;
}
cin>>m;
FOR(i,n+1,n+m){
cin>>a[i].x>>a[i].y>>a[i].z;
a[i].type=2;
}
n+=m;
sort(a+1,a+n+1);
memset(dp,-0x3f,sizeof(dp));
dp[0]=0;
FOR(i,1,n){
int x=a[i].x,z=a[i].z;
int type=a[i].type;
if (type==1){
FORD(j,sum-x,0) maximize(dp[j+x],dp[j]-z);
}
else{
FOR(j,x,sum) maximize(dp[j-x],dp[j]+z);
}
}
cout<<*max_element(dp,dp+sum+1);
return 0;
}
