#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (gcd)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (lcm)
// HERE IS THE SOLUTION
const int MAXN = 50 * 5000;
signed main()
{
boost;
cin.tie(0);
cout.tie(0);
int n , m;
cin>>n;
vector<tuple<int , int , int>> obj;
fore(i , n)
{
int c , f , v;
cin>>c>>f>>v;
obj.pb({f , c , -v});
}
cin>>m;
fore(i , m)
{
int c , f , v;
cin>>c>>f>>v;
obj.pb({f , -c , v});
}
sort(rall(obj));
vi dp(MAXN , -INF);
dp[0] = 0;
for(auto [f , c , v] : obj)
{
if(c >= 0)
{
forn(i , MAXN - 1, 0)
{
if(i - c >= 0)
{
dp[i] = max(dp[i] , dp[i - c] + v);
}
}
}
else
{
fore(i , MAXN)
{
if(i - c < MAXN)
{
dp[i] = max(dp[i] , dp[i - c] + v);
}
}
}
}
int ans = -INF;
fore(i , MAXN)
ans = max(ans , dp[i]);
cout<<ans<<nl;
}
