/*input
4
4 2200 700
2 1800 10
20 2550 9999
4 2000 750
3
1 1500 300
6 1900 1500
3 2400 4550
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long
#define ld long double
#define pii pair<int,int>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=998244353;
// big mod 3006703054056749LL;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
out<<P.f<<' '<<P.s;
return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
return out;
}
ll mult(ll a,ll b){
return (a*b)%MOD;
}
ll mypow(ll a,ll b){
if(b<=0) return 1;
a%=MOD;
ll res=1LL;
while(b){
if(b&1){
res=(res*a)%MOD;
}
a=(a*a)%MOD;
b>>=1;
}
return res;
}
const int maxn=1e5+5;
const int maxlg=__lg(maxn)+2;
ll dp[maxn];
int main(){
int n;
cin>>n;
vector<pair<int,pii>> v;
REP(i,n){
int a,b,c;
cin>>a>>b>>c;
v.pb({b,{a,-c}});
}
int m;
cin>>m;
REP(i,m){
int a,b,c;
cin>>a>>b>>c;
v.pb({b,{-a,c}});
}
sort(ALL(v)),reverse(ALL(v));
REP1(j,maxn-1) dp[j]=-INF64;
for(auto x:v){
if(x.s.f>0){
for(int i=maxn-x.s.f-1;i>=0;i--){
MXTO(dp[i+x.s.f],dp[i]+x.s.s);
}
}
else{
for(int i=-x.s.f;i<maxn;i++){
MXTO(dp[i+x.s.f],dp[i]+x.s.s);
}
}
}
cout<<*max_element(dp,dp+maxn);
}
