#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
#define pint pair<int, int>
#define vint vector<pair<int, int>>
const int mod = 1e9 + 7;
const int shrek = 4000 * 20;
const int say = INT_MAX;
const int gex = INT_MIN;
const long long oo = 1e18;
int pre[4000 * 20];
int cur[4000 * 20];
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
vector<array<int, 3>> v;
int n; cin >> n;
int maxi = 0;
for(int i = 0; i < n; i++) {
int a, b , c; cin >> a >> b >> c;
v.pb({b, -c, a});
maxi += a;
}
int m; cin >> m;
for(int i = 0; i < m; i++) {
int a, b, c; cin >> a >> b >> c;
v.pb({b, c, -a});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
int len = n + m;
for(int j = 0; j <= maxi; j++) {
pre[j] = -1e18;
}
pre[0] = 0;
for(int i = 0; i < len; i++) {
for(int j = 0; j <= maxi; j++) cur[j] = pre[j];
for(int j = 0; j <= maxi; j++) {
int l = j - v[i][2];
if(0 <= l && l <= maxi && pre[l] != -1e18) {
cur[j] = max(cur[j], pre[l] + v[i][1]);
}
}
for(int j = 0; j <= maxi; j++) pre[j] = cur[j];
}
int gayans = 0;
for(int j = 0; j <= maxi; j++) {
gayans = max(gayans, pre[j]);
}
cout << gayans << '\n';
return 0;
}
