#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

const int MAXN = 100000+5;

int X[MAXN];
int Y[MAXN];
int HP[MAXN];
const int offset = 500;
int D[2011][2011];

int main()
{
    int N,K;
    cin>>N>>K;
    FOR(i,N) scanf("%d%d%d",&X[i],&Y[i],&HP[i]);
    memset(D , 0 , sizeof(D));
    FOR(_,K){
        int ax,ay,w,h,d;
        scanf("%d%d%d%d%d",&ax,&ay,&w,&h,&d);
        ax += offset;
        ay += offset;
        D[ay][ax]+=d;
        D[ay+h+1][ax]-=d;
        D[ay][ax+w+1]-=d;
        D[ay+h+1][ax+w+1]+=d;
    }
    FOR(i,1010) FOR(j,1010) D[i][j+1] += D[i][j];
    FOR(i,1010) FOR(j,1010) D[j+1][i] += D[j][i];
    long long ans = 0 ;
    FOR(i,N){
        long long remain = HP[i] - D[Y[i]+offset][X[i]+offset];
        if(remain > 0) ans += remain;
    }
    cout<<ans<<endl;
    return 0;
}