#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
const int KMax = 100000;
int Ex[KMax],Ey[KMax],EH[KMax];
int tiles[1001][1001];

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(10);//
	
	int N,K;
	int x,y,w,h,d;
	cin>>N>>K;
	rep(i,N){
		cin>>x>>y>>EH[i];
		Ex[i] = x+500;
		Ey[i] = y+500;
	}
	rep(i,K){
		cin>>x>>y>>w>>h>>d;
		x += 500;
		y += 500;
		tiles[y][x] += d;
		if(x+w+1 <= 1000){
		tiles[y][x+w+1] -= d;
		}
		if(y+h+1 <= 1000){
			tiles[y+h+1][x] -= d;
		}
		if( x+w+1 <= 1000 && y+h+1 <= 1000){
			tiles[y+h+1][x+w+1] += d;
		}
	}
	//横
	for(int Y = 0; Y <= 1000; ++Y){
		for(int X = 1; X <= 1000; ++X){
			tiles[Y][X] += tiles[Y][X-1];
		}
	}
	//縦
	for(int Y = 1; Y <= 1000; ++Y){
		for(int X = 0; X <= 1000; ++X){
			tiles[Y][X] += tiles[Y-1][X];
		}
	}
	////
	/*
	for(int Y=490; Y <=500+10;++Y){
		for(int X=490; X <= 510; ++X){
			cout << tiles[Y][X] << " ";
		}
		cout << endl;
	}
	*/
	///////////
	int ans = 0;
	int temp;
	rep(i,N){
		//Ex[i],Ey[i],EH[i]
		temp = EH[i] - tiles[ Ey[i] ][ Ex[i] ];
		if(temp > 0){
			ans += temp;
		}
	}
	P(ans);
    return 0;
}