#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
using namespace std;
#define rep(i,n) for(int (i) = 0 ; (i) < (int)(n) ; (i)++)
#define REP(i,a,b) for(int (i) = a ; (int)(i) <= (int)(b) ; (i)++)
#define all(n) (n).begin(),(n).end()
typedef long long ll;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<long long,long long> Pii;
typedef vector<Pii> VPii;
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> set2;


int imos[1510][1510];
int hp[1510][1510];
int main(){
	int N,K;
	cin >> N >> K;
	rep(i,N){
		int X,Y,H;
		cin >> X >> Y >> H;
		X += 505;
		Y += 505;
		hp[Y][X] = H;
	}
	rep(i,K){
		int X,Y,W,H,D;
		cin >> X >> Y >> W >> H >> D;
		X += 505;
		Y += 505;
		imos[Y][X] += D;
		imos[Y][X+W+1] -= D;
		imos[Y+H+1][X] -= D;
		imos[Y+H+1][X+W+1] += D;	
	}
	REP(i,1,1008)REP(j,1,1008)
		imos[i][j] += imos[i][j-1];
	int ans = 0;
	REP(i,1,1008)REP(j,1,1008){
		imos[i][j] += imos[i-1][j];
		if( hp[i][j] && imos[i][j] < hp[i][j] ){
			ans += hp[i][j] - imos[i][j];
		}
	}
	cout << ans << endl;
}