#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int inf=1e18;
const int mxn=2e3+1;
const int mxc=1e5+1;

int n,m;
array<int,3> buy[mxn], sel[mxn];
vector<int> dt;
int dp[mxc];

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	cin>>n;
	for (int i=0; i<n; i++) {
		cin>>buy[i][1]>>buy[i][0]>>buy[i][2];
		dt.push_back(buy[i][0]);
	}
	cin>>m;
	for (int i=0; i<m; i++) {
		cin>>sel[i][1]>>sel[i][0]>>sel[i][2];
		dt.push_back(sel[i][0]);
	}
	sort(all(dt)); dt.erase(unique(all(dt)),dt.end());
	reverse(all(dt));
	
	sort(buy,buy+n); reverse(buy,buy+n);
	sort(sel,sel+n); reverse(sel,sel+n);
	
	dp[0]=0;
	for (int i=1; i<mxc; i++) {dp[i]=-inf;}
	
	int bp=0,sp=0;
	for (int f : dt) {
		while (bp<n && buy[bp][0]==f) {
			int cost=buy[bp][2];
			int amt=buy[bp][1];
			for (int i=mxc-1; i>=0; i--) {
				if (dp[i]==-inf) continue;
				if (i+amt>=mxc) continue;
				dp[i+amt]=max(dp[i+amt],dp[i]-cost);
			}
			bp++;
		}
		while (sp<m && sel[sp][0]==f) {
			int val=sel[sp][2];
			int amt=sel[sp][1];
			for (int i=0; i<mxc; i++) {
				if (dp[i]==-inf) continue;
				if (i-amt<0) continue;
				dp[i-amt]=max(dp[i-amt],dp[i]+val);
			}
			sp++;
		}
	}
	int ans=0;
	for (int i=0; i<mxc; i++) {
		ans=max(ans,dp[i]);
	}
	cout<<ans;
	
	return 0;
}