#include<bits/stdc++.h>
using namespace std;
const int N = 2020, M = 52;
bool fl = 1;
#define x first
#define y second
typedef long long LL;
typedef pair < bool, LL > pbL;
int n, m;
struct Node
{
  int c, f, v, type;
  bool operator < (const Node & t) const
  {
	return f < t.f;
  }
}
a[N + N], p1[N], p2[N];
int tot, s, s1;
pbL f[N * M], g[N + N];
int
main ()
{
  scanf ("%d", &n);
  for (int i = 1; i <= n; i++)
	{
	  tot++;
	  scanf ("%d%d%d", &a[tot].c, &a[tot].f, &a[tot].v);
	  a[tot].type = 1;
	  if (a[tot].v > 1)
		fl = 0;
	  s += a[tot].c;
	  p1[i] = a[tot];
	}
  scanf ("%d", &m);
  for (int i = 1; i <= m; i++)
	{
	  tot++;
	  scanf ("%d%d%d", &a[tot].c, &a[tot].f, &a[tot].v);
	  a[tot].type = 2;
	  if (a[tot].v > 1)
		fl = 0;
	  s1 += a[tot].c;
	  p2[i] = a[tot];
	}
  if (fl)
	{
	}
  sort (a + 1, a + tot + 1);
  sort (p1 + 1, p1 + tot + 1);
  sort (p2 + 1, p2 + tot + 1);
  f[0].x = 1;
  g[n].x = 1;
  if (fl == 0||1)
	{
	  for (int i = 1; i <= tot/2; i++)
		{
		  pbL cur;
		  if (a[i].type == 1)
			{
			  for (int j = 0; j <= s1; j++)
				{
				  cur = f[j];
				  cur.y -= a[i].v;
				  f[max (j - a[i].c, 0)] = max (f[max (j - a[i].c, 0)], cur);
				}
			}
		  else
			{
			  for (int j = s1 - a[i].c; j >= 0; j--)
				{
				  cur = f[j];
				  cur.y += a[i].v;
				  f[j + a[i].c] = max (f[j + a[i].c], cur);
				}
			}
		}
	  printf ("%lld\n", f[0].y);
	}
  else
	{
	  //   cout<<s1<<endl;
	  g[n].x = 1;
	  g[n].y = s1;
	  for (int i = 1; i <= tot; i++)
		{
		  pbL cur;
		  if (a[i].type == 1)
			{
			  for (int j = 1; j <= n + m; j++)
				{
				  cur = g[j];
				  cur.y += a[i].c;
				  cur.y = min (cur.y, (LL) s1);
				  g[j - 1] = max (g[j - 1], cur);
				}
			}
		  else
			{
			  for (int j = n + m - 1; j >= 0; j--)
				{
				  cur = g[j];
				  cur.y -= a[i].c;
				  g[j + 1] = max (g[j + 1], cur);
				}
			}
		  /*    cout<<i<<endl;
		     for(int j=0;j<=n+m;j++)
		     {
		     cout<<g[j].x<<' '<<g[j].y<<endl;
		     } */
		}
	  for (int i = n + m; i >= n; i--)
		{
		  //    cout<<g[i].x<<' '<<g[i].y<<endl;
		  if (g[i].x == 1 && g[i].y == s1)
			{
			  printf ("%d\n", i - n);
			  break;
			}
		}
	}
  return 0;
}