#include <iostream>

using namespace std;

const int MAXN = 100000;
const int MAXK = 100000;
const int MAXX = 1001;
const int MAXY = 1001;

int N, K;
int X[MAXN], Y[MAXN], HP[MAXN];
int AX, AY, W, H, D;
int damage[MAXX][MAXY];

int main() {
	cin >> N >> K;
	for (int i = 0; i < N; i++) {
		cin >> X[i] >> Y[i] >> HP[i];
	}
	for (int i = 0; i < K; i++) {
		cin >> AX >> AY >> W >> H >> D;
		damage[AX + 500][AY + 500] += D;
		if (AX + W + 1 + 500 < MAXX) {
			damage[AX + W + 1 + 500][AY + 500] -= D;
		}
		if (AY + H + 1 + 500 < MAXY) {
			damage[AX + 500][AY + H + 1 + 500] -= D;
		}
		if (AX + W + 1 + 500 < MAXX && AY + H + 1 + 500 < MAXY) {
			damage[AX + W + 1 + 500][AY + H + 1 + 500] += D;
		}
	}
	for (int x = 0; x < MAXX; x++) {
		for (int y = 1; y < MAXY; y++) {
			damage[x][y] += damage[x][y - 1];
		}
	}
	for (int y = 0; y < MAXY; y++) {
		for (int x = 1; x < MAXX; x++) {
			damage[x][y] += damage[x - 1][y];
		}
	}
	int ans = 0;
	for (int i = 0; i < N; i++) {
		ans += max(0, HP[i] - damage[X[i] + 500][Y[i] + 500]);
	}
	cout << ans << endl;
	return 0;
}