#include <bits/stdc++.h>

using i64 = long long;

constexpr int MAXC = 20;
constexpr i64 INF = 0x3f3f3f3f3f3f3f3f;

int main() {
  std::ios::sync_with_stdio(false);

  int n;
  std::cin >> n;

  std::vector<std::tuple<int, int, i64>> comp(n);
  std::vector<int> cc;
  for (auto& [c, f, v] : comp) {
    std::cin >> c >> f >> v;
    cc.push_back(f);
  }

  int m;
  std::cin >> m;
  std::vector<std::tuple<int, int, i64>> ord(m);
  for (auto& [c, f, v] : ord) {
    std::cin >> c >> f >> v;
    cc.push_back(f);
  }
  std::sort(cc.begin(), cc.end());
  cc.erase(std::unique(cc.begin(), cc.end()), cc.end());
  int k = static_cast<int>(cc.size());

  std::vector<std::vector<std::pair<int, int>>> tr_comp(k), tr_ord(k);
  for (auto& [c, f, v] : comp) {
    f = static_cast<int>(
      std::lower_bound(cc.begin(), cc.end(), f) - cc.begin()
    );
    tr_comp[f].emplace_back(c, v);
  }
  for (auto& [c, f, v] : ord) {
    f = static_cast<int>(
      std::lower_bound(cc.begin(), cc.end(), f) - cc.begin()
    );
    tr_ord[f].emplace_back(c, v);
  }

  int mx = MAXC * n;
  std::vector<i64> dp(mx + 1, -INF);
  dp[0] = 0;
  for (int f = k - 1; f >= 0; --f) {
    for (auto [c, v] : tr_comp[f]) {
      for (int j = mx; j >= c; --j) {
        dp[j] = std::max(dp[j], dp[j - c] - v);
      }
    }
    for (auto [c, v] : tr_ord[f]) {
      for (int j = 0; j <= mx - c; ++j) {
        dp[j] = std::max(dp[j], dp[j + c] + v);
      }
    }
  }
  std::cout << *std::max_element(dp.begin(), dp.end()) << '\n';
}