#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
vector<vector<int>> v;
const long long inf = -2e18;
/*long long dp[2001][100750];
long long f(int idx, int cores){
if(idx == (int) v.size()) return 0;
if(dp[idx][cores] != -1) return dp[idx][cores];
long long not_take = f(idx + 1, cores), take = 0;
if(v[idx][1] == 0){
take = (long long) f(idx + 1, cores + v[idx][2]) - v[idx][3];
}else{
if(v[idx][2] <= cores){
take = (long long) f(idx + 1, cores - v[idx][2]) + v[idx][3];
}
}
return dp[idx][cores] = max(take, not_take);
}*/
signed main(){
ios::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
int n, m, cores = 0; cin >> n;
for(int i = 0, a, b, c; i < n; ++i){
cin >> a >> b >> c;
v.push_back({b, 0, a, c});
cores += a;
}
cin >> m;
for(int i = 0, a, b, c; i < m; ++i){
cin >> a >> b >> c;
v.push_back({b, 1, a, c});
cores += a;
}
sort(all(v));
vector<long long> dp(cores + 5, 0);
for(int i = 0; i < v.size(); ++i){
vector<long long> ndp(cores + 5, 0);
for(int j = 0; j <= cores; ++j){
ndp[j] = dp[j];
if(v[i][1] == 0){
if(j + v[i][2] <= cores) ndp[j] = max(ndp[j], (long long) dp[j + v[i][2]] - v[i][3]);
}else{
if(v[i][2] <= j){
ndp[j] = max(ndp[j], (long long) dp[j - v[i][2]] + v[i][3]);
}
}
}
swap(dp, ndp);
}
cout << dp[0] << "\n";
return 0;
}
