#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define maxn 200009
#define fi first
#define se second
#define pb push_back
#define left id<<1
#define right id<<1|1
#define re exit(0);
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ;
const int LOG = 18 ;
typedef vector<int> vi ;
typedef pair<int,int> pii ;
typedef vector<ll> vl ;
typedef vector<pii> vii ;
void add ( int &a , int b )
{
a += b ;
if ( a < 0 ) a += mod ;
if ( a >= mod ) a -= mod ;
}
template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
// freopen ("bai1.out","w",stdout) ;
}
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
int n , m ;
struct pa {
int c , f , v ;
} a [maxn] , b [maxn] ;
bool cmp_f ( pa u , pa v )
{
return u.f > v.f ;
}
int sum_c ;
ll dp [10009] ;
void update ( pa A , int id )
{
vl F (sum_c+2,-1e18) ;
for ( int i = 0 ; i <= sum_c ; i ++ )
{
int New = i+A.c*id ;
if ( New >= 0 && New <= sum_c ) chkmax (F[New],dp[i]-A.v*id) ;
}
for ( int i = 0 ; i <= sum_c ; i ++ ) chkmax (dp[i],F[i]) ;
}
int main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0) ;
// rf () ;
cin >> n ;
for ( int i = 1 ; i <= n ; i ++ ) cin >> a[i].c >> a[i].f >> a[i].v , sum_c += a[i].c ;
cin >> m ;
for ( int i = 1 ; i <= m ; i ++ ) cin >> b[i].c >> b[i].f >> b[i].v ;
sort (a+1,a+n+1,cmp_f) ;
sort (b+1,b+m+1,cmp_f) ;
memset ( dp , -0x3f , sizeof dp ) ;
dp [0] = 0 ;
int j = 1 ;
for ( int i = 1 ; i <= m ; i ++ )
{
while ( j <= n && a[j].f >= b[i].f ) update (a[j++],1) ;
update (b[i],-1) ;
}
ll res = 0 ;
for ( int i = 0 ; i <= sum_c ; i ++ ) chkmax (res,dp[i]) ;
cout << res ;
}
// range , error , check special , ...
// find key , find key
//'-std=c++11' stay hard
// there is no tomorrow
