#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <tr2/dynamic_bitset>
using namespace std;
using namespace __gnu_pbds;
using namespace tr2;
#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()
#define uniq(x) unique(all(x)), x.end()
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template<class Fun> class y_combinator_result {
Fun fun_;
public:
template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }
template <class T, size_t N>
void re(array <T, N>& x);
template <class T>
void re(vt <T>& x);
template <class T>
void re(T& x) {
cin >> x;
}
template <class T, class... M>
void re(T& x, M&... args) {
re(x), re(args...);
}
template <class T>
void re(vt <T>& x) {
for(auto& it : x) re(it);
}
template <class T, size_t N>
void re(array <T, N>& x) {
for(auto& it : x) re(it);
}
template <class T, size_t N>
void wr(const array <T, N>& x);
template <class T>
void wr(const vt <T>& x);
template <class T>
void wr(const T& x) {
cout << x;
}
template <class T, class ...M>
void wr(const T& x, const M&... args) {
wr(x), wr(args...);
}
template <class T>
void wr(const vt <T>& x) {
for(auto it : x) wr(it, ' ');
}
template <class T, size_t N>
void wr(const array <T, N>& x) {
for(auto it : x) wr(it, ' ');
}
template<class T, class... M>
auto mvt(size_t n, M&&... args) {
if constexpr(sizeof...(args) == 1)
return vector<T>(n, args...);
else
return vector(n, mvt<T>(args...));
}
void set_fixed(int p = 0) {
cout << fixed << setprecision(p);
}
void set_scientific() {
cout << scientific;
}
void Open(const string& name) {
#ifndef ONLINE_JUDGE
(void)!freopen((name + ".in").c_str(), "r", stdin);
(void)!freopen((name + ".out").c_str(), "w", stdout);
#endif
}
void solve() {
int n; re(n);
vt <ar <int, 3>> a(n); re(a);
int m; re(m);
vt <ar <int, 3>> b(m); re(b);
vt <ar <int, 3>> v(n + m);
for (int i = 0; i < n; ++i) {
auto& [c, f, val] = a[i];
val = -val;
v[i] = a[i];
}
for (int i = n; i < n + m; ++i) {
auto& [c, f, val] = b[i - n];
c = -c;
v[i] = b[i - n];
}
sort(all(v), [&](auto& a, auto& b) -> bool {
if (a[1] != b[1])
return a[1] > b[1];
if (a[0] != b[0])
return a[0] > b[0];
return a[2] > a[2];
});
vt <ll> dp(100'005, -1e18);
dp[0] = 0;
for (auto& [c, f, val] : v) {
if (c > 0) {
for (int i = 100'000; i >= c; --i)
dp[i] = max(dp[i], dp[i - c] + val);
} else {
for (int i = 0; i <= 100'000 + c; ++i)
dp[i] = max(dp[i], dp[i - c] + val);
}
}
wr(*max_element(all(dp)), '\n');
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//Open("");
int t = 1;
for(;t;t--) {
solve();
}
return 0;
}
