#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
typedef unsigned long long ul;
ll h[1002][1002];
int n, k;
ll a[1002][1002];
int main() {
	cin >> n >> k;
	rep(i, n) {
		int x, y; cin >> x >> y; cin >> h[x + 500][y + 500];
	}
	rep(i, k) {
		int x, y, dx, dy, d;
		cin >> x >> y >> dx >> dy >> d;
		x += 500; y += 500;
		int rx = min(x + dx+1, 1001); int ry = min(y + dy+1, 1001);
		a[x][y] += d; a[x][ry] -= d; a[rx][y] -= d; a[rx][ry] += d;
	}
	rep(i, 1002) {
		rep(j, 1001) {
			a[i][j + 1] += a[i][j];
		}
	}
	rep(j, 1002) {
		rep(i, 1001) {
			a[i + 1][j] += a[i][j];
		}
	}
	ll ans = 0;
	rep(i, 1002) {
		rep(j, 1002) {
			if (h[i][j]) {
				ans += max((ll)0, h[i][j] - a[i][j]);
			}
		}
	}
	cout << ans << endl;
	//stop
	return 0;
}