#include <bits/stdc++.h>
using namespace std;
// ordered set whith s.order_of_key(x) method, which returns rank of element x in set s
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
*/
// pair printing
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "(" << par.first << "; " << par.second << ")"; return out;}
// set printing
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// map printing
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// unordered_set printing
template <class T>
ostream& operator<<(ostream& out, const unordered_set<T> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// unordered_map printing
template <class T, class U>
ostream& operator<<(ostream& out, const unordered_map<T, U> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// vector printing
template<class T>
ostream& operator<<(ostream& out, const vector<T> &cont){ out << "["; for (const auto &x:cont) out << x << ", "; out << "]"; return out;}
#define print(x) cout << (x) << endl;
#define dmp(x) cerr << #x << " = " << x << endl
#define dmpn(x) cerr << #x << " = " << x << "; "
#define dmpl(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << x << endl
#define int long long
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define pb push_back
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define contains(s,x) ((s).find(x) != (s).end())
const int MOD = 998244353;
struct item {
int f, c, price;
bool is_order;
};
bool compare(item &a, item &b) {
if (a.f == b.f) return a.is_order < b.is_order;
return a.f > b.f;
}
int N, M;
void solve() {
cin >> N;
vector<item> v(N);
for (int i = 0; i < N; i++) cin >> v[i].c >> v[i].f >> v[i].price;
cin >> M;
v.resize(N + M);
for (int i = N; i < N + M; i++) {
cin >> v[i].c >> v[i].f >> v[i].price;
v[i].is_order = true;
}
sort(all(v), compare);
vector<int> last = { 0 };
for (auto itm : v) {
vector<int> current = last;
// dmpn(itm.f); dmpn(itm.c); dmpn(itm.price); dmp(itm.is_order);
for (int i = 0; i < sz(last); i++) {
if (itm.is_order) {
if (i + itm.c >= sz(last)) current[i] = last[i];
else current[i] = max(last[i], last[i + itm.c] + itm.price);
} else {
if (i - itm.c < 0) max(last[i], last[0] - itm.price);
else current[i] = max(last[i], last[i - itm.c] - itm.price);
}
}
if (!itm.is_order) {
for (int i = sz(last); i < sz(last) + itm.c; i++) {
if (i - itm.c < 0) current.pb(last[0] - itm.price);
else current.pb(last[i - itm.c] - itm.price);
}
} else {
for (int i = sz(current) - 2; i >= 0; i--) {
current[i] = max(current[i], current[i + 1]);
}
}
// dmp(current);
last = current;
}
int ans = last[0];
cout << ans << endl;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
}
