#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=(r)-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,-1,0,1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


int main(){
    ll n,k;cin >> n >> k;
    vl x(n),y(n),hp(n);rep(i,n)cin >> x[i] >> y[i] >> hp[i];
    vvl g(2000,vl(2000));
    rep(i,k){
        ll ax,ay,w,h,d;cin >> ax >> ay >> w >> h >> d;
        g[ax+1000][ay+1000]+=d;
        g[ax+1000+w+1][ay+1000]-=d;
        g[ax+1000][ay+1000+h+1]-=d;
        g[ax+1000+w+1][ay+1000+h+1]+=d;
    }
    rep(i,1999)rep(j,2000)g[i+1][j]+=g[i][j];
    rep(i,2000)rep(j,1999)g[i][j+1]+=g[i][j];
    /*rep(i,20){
        rep(j,20){
            cout << g[i+1000-10][j+1000-10] <<" ";
        }
        cout << endl;
    }*/
    ll ans=0;
    rep(i,n){
        ans+=max(0LL,hp[i]-g[x[i]+1000][y[i]+1000]);
    }
    cout << ans <<endl;
}