#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

struct enemy { ll X, Y, HP; };
struct attack { ll X, Y, W, H, D; };

int main() {
  ll N, K; cin >> N >> K;
  enemy e[N]; rep(i,N) cin >> e[i].X >> e[i].Y >> e[i].HP;
  attack a[K]; rep(i,K) cin >> a[i].X >> a[i].Y >> a[i].W >> a[i].H >> a[i].D;

  ll pos[1010][1010] = {};
  rep(i,K) {
    ll u = max(0ll,500+a[i].Y), d = min(1000ll,500+a[i].Y+a[i].H);
    ll l = max(0ll,500+a[i].X), r = min(1000ll,500+a[i].X+a[i].W);
    repr(h,u,d+1) { pos[h][l]+=a[i].D; pos[h][r+1]-=a[i].D; }
  }
  rep(h,1010) repr(w,1,1010) pos[h][w] += pos[h][w-1];
  // pos[500][500] = 0; repr(h,495,505) debug(pos[h]+495, pos[h]+505);

  ll result = 0; rep(i,N) result += max(0ll, e[i].HP-pos[500+e[i].Y][500+e[i].X]);
  cout << result << endl;
  return 0;
}