#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)
using namespace std;
#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#ifdef wiwihorz
#define print(a...) cerr << "Line " << __LINE__ << ": ", kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#else
#define print(...) 0
#define vprint(...) 0
#endif
namespace solver {
int n, m;
vector<int> c1, f1, v1;
vector<int> c2, f2, v2;
vector<int> dp;
vector<pii> id;
void init_n(int _n) {
n = _n;
c1.assign(n + 1, 0);
f1.assign(n + 1, 0);
v1.assign(n + 1, 0);
dp.assign(50 * n + 1, -INF);
}
void init_m(int _m) {
m = _m;
c2.assign(m + 1, 0);
f2.assign(m + 1, 0);
v2.assign(m + 1, 0);
}
int solve() {
rep(i, 1, n) id.push_back({i, 0});
rep(i, 1, m) id.push_back({i, 1});
sort(all(id), [](pii a, pii b) {
int fa = (a.second ? f2[a.first] : f1[a.first]);
int fb = (b.second ? f2[b.first] : f1[b.first]);
if(fa != fb) return fa > fb;
else return a.second < b.second;
});
dp[0] = 0;
int cur = 0;
rep(i, 0, m + n - 1) {
int tp = id[i].second, idx = id[i].first;
cur += (!tp) * c1[i];
if(tp == 0) rrep(j, c1[i], cur) dp[j] = max(dp[j], dp[j - c1[idx]] - v1[idx]);
else rep(j, 0, cur - c2[i]) dp[j] = max(dp[j], dp[j + c2[idx]] + v2[idx]);
}
int ans = 0;
rep(i, 0, cur) ans = max(ans, dp[i]);
return ans;
}
};
using namespace solver;
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
int n; cin >> n;
init_n(n);
rep(i, 1, n) cin >> c1[i] >> f1[i] >> v1[i];
int m; cin >> m;
init_m(m);
rep(i, 1, m) cin >> c2[i] >> f2[i] >> v2[i];
cout << solve() << "\n";
return 0;
}
