#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
void solve(int testcase_number){
cin>>n;
int sm =0;
vector<vector<int>>ord;
for(int i =0;i<n;i++){
int a,b,c;
cin>>a>>b>>c;
sm+=a;
ord.pb({b,a,c,0});
}
int m;
cin>>m;
for(int i =0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
sm+=a;
ord.pb({b,a,c,1});
}
sort(all(ord));
reverse(all(ord));
n+=m;
for(int i = 0;i<ord.size();i++){
swap(ord[i][0],ord[i][1]);
}
vector<int>dp(sm+10,-inf);
dp[0] = 0;
for(auto i:ord){
int c = i[0];
int f = i[1];
int v = i[2];
if(i[3]){
for(int j = 0;j+c<=sm;j++){
if(dp[j+c] != -inf){
dp[j] = max(dp[j],dp[j+c]+v);
}
}
}
else{
for(int j = sm;j>=c;j--){
if(dp[j-c] != -inf){
dp[j] = max(dp[j],dp[j-c]-v);
}
}
}
}
// print(dp);
int ans = 0;
for(int i = 0;i<=sm;i++){
ans = max(ans,dp[i]);
}
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
