#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using P = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rep(x,s,e) for (auto x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e)?x++:x--))
#define sz(x) (int)x.size()
const char nl = '\n';
const int N = 1e5+10;
const int inf = 1e9*2e3+100;
void solve() {
int n; cin >> n;
vector<P> a(n);
for (auto &i: a) {
int x;
cin >> i.first >> x >> i.second;
i.second *= -1;
}
int m; cin >> m;
vector<P> b(m);
for (auto &i: b) {
int x;
cin >> i.first >> x >> i.second;
i.first *= -1;
}
vector<int> dp(N, -inf);
dp[0] = 0;
rep(i, 0, n)
rep(j, N, a[i].first)dp[j] = max(dp[j], dp[j-a[i].first]+a[i].second);
rep(i, 0, m)
rep(j, 0, -b[i].first+1)
dp[j] = max(dp[j], dp[j-b[i].first]+b[i].second);
int res = 0;
rep(i, 0, N)
res = max(res, dp[i]);
cout << res << nl;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
