#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
struct event
{
int cores,f,cost;
bool operator<(const event& other) const
{
if(f != other.f) return f<other.f;
return cores<other.cores;
}
};
const int max_cores = 2000*50+1;
ll dp[max_cores];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n;
cin >> n;
vector<event> events;
rep(i,n)
{
int c,f,v;
cin >> c >> f >> v;
events.pb({c,f,-v});
}
int m;
cin >> m;
rep(i,m)
{
int c,f,v;
cin >> c >> f >> v;
events.pb({-c,f,v});
}
sort(all(events));
reverse(all(events));
dp[0] = 0;
rep2(i,1,max_cores-1) dp[i] = -1e18;
forall(it,events)
{
if(it.cores > 0)
{
for(int c = max_cores-1; c >= it.cores; c--)
{
dp[c] = max(dp[c],dp[c-it.cores] + it.cost);
}
}
else
{
rep(c,max_cores+it.cores)
{
dp[c] = max(dp[c],dp[c-it.cores] + it.cost);
}
}
}
ll ans = 0;
rep(i,max_cores) ans = max(ans,dp[i]);
cout << ans << "\n";
}
