#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	int N, K; cin >> N >> K;
	vector<int> X(N), Y(N), h(N);
	for (int i = 0; i < N; i++) {
		cin >> X[i] >> Y[i] >> h[i];
		X[i] += 500; Y[i] += 500;
	}
	vector<int> AX(K), AY(K), W(K), H(K), D(K);
	for (int j = 0; j < K; j++) {
		cin >> AX[j] >> AY[j] >> W[j] >> H[j] >> D[j];
		AX[j] += 500; AY[j] += 500; W[j]++; H[j]++;
	}
	vector< vector<ll> > imos(2000, vector<ll>(2000));
	for (int j = 0; j < K; j++) {
		imos[AY[j]][AX[j]] += D[j];
		imos[AY[j]][AX[j] + W[j]] -= D[j];
		imos[AY[j] + H[j]][AX[j]] -= D[j];
		imos[AY[j] + H[j]][AX[j] + W[j]] += D[j];
	}
	vector< vector<ll> > sum(2001, vector<ll>(2001));
	for (int y = 1; y <= 2000; y++)
		for (int x = 1; x <= 2000; x++)
			sum[y][x] += sum[y][x - 1] + sum[y - 1][x] - sum[y - 1][x - 1] + imos[y - 1][x - 1];
	ll ans = 0;
	for (int i = 0; i < N; i++)
		ans += max(0LL, h[i] - sum[Y[i] + 1][X[i] + 1]);
	cout << ans << endl;
}