#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, k, x[100000], y[100000], hp[100000];
LL sum[1002][1002];

int main() {
	cin >> n >> k;
	inc(i, n) {
		cin >> x[i] >> y[i] >> hp[i];
		x[i] += 500;
		y[i] += 500;
	}
	inc(i, k) {
		LL ax, ay, w, h, d;
		cin >> ax >> ay >> w >> h >> d;
		ax += 500;
		ay += 500;
		w++;
		h++;
		setmin(w, 1001 - ax);
		setmin(h, 1001 - ay);
		
		sum[ax    ][ay    ] += d;
		sum[ax + w][ay    ] -= d;
		sum[ax    ][ay + h] -= d;
		sum[ax + w][ay + h] += d;
	}
	
	inc(i, 1002) {
	inc(j, 1002) {
		if(j != 0) { sum[i][j] += sum[i][j - 1]; }
	}
	}
	
	inc(i, 1002) {
	inc(j, 1002) {
		if(i != 0) { sum[i][j] += sum[i - 1][j]; }
	}
	}
	
	LL ans = 0;
	inc(i, n) {
		ans += max(0LL, hp[i] - sum[ x[i] ][ y[i] ]);
	}
	
	cout << ans << endl;
	
	return 0;
}