#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define int ll
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, int>
#define vi vector <int>
const ll nmax=1e5+2;
const ll mod = 998244353;
int n, m;
pii v[4004];
int dp[2][nmax];
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
cin>>n;
for(int i=1; i<=n; i++){
cin>>v[i].x.y>>v[i].x.x>>v[i].y;
v[i].y*=-1;
}
cin>>m;
for(int i=n+1; i<=n+m; i++){
cin>>v[i].x.y>>v[i].x.x>>v[i].y;
v[i].x.y*=-1;
}
sort(v+1, v+n+m+1, greater<pii>());
// for(int i=1; i<=n+m; i++) cout<<v[i].x.x<<" "<<v[i].x.y<<" "<<v[i].y<<endl;
for(int i=1; i<nmax; i++){
dp[1][i]=dp[0][i]=-1e18;
}
int ans=0;
for(int i=1; i<=n+m; i++){
for(int j=0; j<nmax; j++){
if(j-v[i].x.y>=0 && j-v[i].x.y<nmax) dp[1][j]=max(dp[0][j], dp[0][j-v[i].x.y]+v[i].y);
}
// for(int j=0; j<=20; j++)if(dp[1][j]<=-1e17) cout<<"-xxx "; else cout<<dp[1][j]<<" ";cout<<dp[1][99992];cout<<"x\n";
for(int j=0; j<nmax; j++){
if(i==n+m) ans=max(ans, dp[1][j]);
dp[0][j]=dp[1][j];
}
}
cout<<ans;
}
