#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
#define SIZE 1001
#define offset 500

//2次元Imos法
class Imos2 {
public:
	vector<vector<int>>table;
	int n, m;

	Imos2(int n_, int m_) {
		n = n_ + 1;
		m = m_ + 1;
		table.resize(n);
		for (int i = 0; i < n; i++)table[i].resize(m);
	}

	void input(pair<int, int>tl, pair<int, int>br, int v) {
		table[tl.first][tl.second] += v;
		table[tl.first][br.second] -= v;
		table[br.first][tl.second] -= v;
		table[br.first][br.second] += v;
	}

	void accumulate() {
		for (int i = 0; i < n; i++) {
			for (int j = 1; j < m; j++) {
				table[i][j] += table[i][j - 1];
			}
		}

		for (int j = 0; j < m; j++) {
			for (int i = 1; i < n; i++) {
				table[i][j] += table[i - 1][j];
			}
		}
	}
};

int solve() {
	Imos2 imos2(SIZE, SIZE);

	int N, K; cin >> N >> K;
	for (int i = 0; i < N; i++) {
		int x, y, hp;
		cin >> x >> y >> hp;
		x += offset; y += offset;
		imos2.input(make_pair(x, y), make_pair(x + 1, y + 1), hp);
	}
	for (int i = 0; i < K; i++) {
		int x, y, w, h, d;
		cin >> x >> y >> w >> h >> d;
		x += offset; y += offset;
		imos2.input(make_pair(x, y), make_pair(min(SIZE,x + w + 1), min(SIZE,y + h + 1)), -d);
	}

	imos2.accumulate();

	int ans = 0;
	for (int i = 0; i < SIZE; i++) {
		for (int j = 0; j < SIZE; j++) {
			if (imos2.table[i][j] > 0)ans += imos2.table[i][j];
		}
	}

	return ans;
}

int main()
{
	cout<< solve() <<endl;
    return 0;
}