#include<iostream>
#include<algorithm>
#define M 1600
#define m 500
typedef long long LL;
LL dam[M][M];
LL enemy[M][M];
using namespace std;
int main(){
	int N, K;
	cin >> N >> K;
	for (int i = 0; i < N; i++){
		int x, y, h;
		cin >> x >> y >> h;
		x += m, y += m;
		enemy[x][y]=h;
	}
	for (int k = 0; k < K; k++){
		int x, y, w, h, d;
		cin >> x >> y >> w >> h >> d;
		x += m, y += m;
		for (int i = 0; i <= w; i++){
			dam[x + i][y] += d;
			dam[x + i][y + h+1] -= d;
		}
	}
	LL res = 0;
	for (int i = 0; i < M; i++){
		LL tmp = 0;
		for (int j = 0; j < M; j++){
			tmp += dam[i][j];
			res += max(0ll, enemy[i][j] - tmp);
		}
	}
	cout << res << endl;
}