#include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (int)(a); v < (int)(b); ++v)
#define FORE(v, a, b) for(int v = (int)(a); v <= (int)(b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define RS resize
#define CLR clear
#define PB push_back
#define PF push_front
#define ALL(x) (x).begin(), (x).end()
#define C complex
#define CI complex< int >
#define CD complex< double >
using namespace std;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n, k;
	int ax, ay, w, h, d;
	const int MAX = 1500;
	vector< int > x, y, hp;
	vector< vector< int > > f;
	
	cin >> n >> k;
	
	x.RS(n);
	y.RS(n);
	hp.RS(n);
	REP(i, n){
		cin >> x[i] >> y[i] >> hp[i];
	}
	
	f.RS(2*MAX+1);
	REP(i, 2*MAX+1){
		f[i].RS(2*MAX+1);
	}
	
	
	REP(i, k){
		cin >> ax >> ay >> w >> h >> d;
		
		f[ax+MAX][ay+MAX] += d;
		f[ax+w+1+MAX][ay+MAX] -= d;
		f[ax+MAX][ay+h+1+MAX] -= d;
		f[ax+w+1+MAX][ay+h+1+MAX] += d;
	}
	
	FOR(i, 0, 2*MAX+1){
		FOR(j, 1, 2*MAX+1){
			f[i][j] += f[i][j-1];
		}
	}
	
	FOR(i, 1, 2*MAX+1){
		FOR(j, 0, 2*MAX+1){
			f[i][j] += f[i-1][j];
		}
	}
	
	REP(i, n){
		hp[i] -= f[x[i]+MAX][y[i]+MAX];
		
		if(hp[i] < 0) hp[i] = 0;
	}
	
	cout << accumulate(ALL(hp), 0) << endl;
	
	return 0;
}