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

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<P> vp;
typedef vector<ll> vll;

const int OFFSET = 600;
const int SIZE = 2 * OFFSET + 1;

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

	int N, K;
	cin >> N >> K;

	vector<P> points;
	vector<int> hp;
	rep(i, N) {
		int x, y, c;
		cin >> x >> y >> c;
		points.emplace_back(P(x, y));
		hp.emplace_back(c);
	}

	vector<vector<int>> damage(SIZE, vector<int>(SIZE, 0));
	rep(i, K) {
		int x1, y1, w, h, d;
		cin >> x1 >> y1 >> w >> h >> d;

		int x2 = min(x1 + w, 500) + 1, y2 = min(y1 + h, 500) + 1;
		x1 += OFFSET; y1 += OFFSET; x2 += OFFSET; y2 += OFFSET;

		damage[x1][y2] -= d;	damage[x2][y2] += d;
		damage[x1][y1] += d;	damage[x2][y1] -= d;
	}

	rep(i, SIZE) {
		rep(j, SIZE - 1) {
			damage[i][j + 1] += damage[i][j];
		}
	}

	rep(j, SIZE) {
		rep(i, SIZE - 1) {
			damage[i + 1][j] += damage[i][j];
		}
	}

	int ans = 0;
	rep(i, N) {
		int x = points[i].first, y = points[i].second;
		x += OFFSET, y += OFFSET;
		ans += max(hp[i] - damage[x][y], 0);
	}

	cout << ans << endl;

}