#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 1005;

int dp[MAX_N][MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,K;
    cin >> n >> K;
    vector<P> pos(n);
    vector<int> hp(n);
    rep(i,n){
        int x,y;
        cin >> x >> y >> hp[i];
        pos[i] = P(x+500,y+500);
    }
    rep(i,K){
        int a,b,w,h,e;
        cin >> a >> b >> w >> h >> e;
        a += 500,b += 500;
        dp[a][b] -= e;
        dp[min(a+w,1000)+1][b] += e;
        dp[a][min(b+h,1000)+1] += e;
        dp[min(a+w,1000)+1][min(b+h,1000)+1] -= e;
    }
    rep(i,1002){
        rep(j,1002){
            dp[i][j+1] += dp[i][j];
        }
    }
    rep(i,1002){
        rep(j,1002){
            dp[i+1][j] += dp[i][j];
        }
    }
    ll ans = 0;
    rep(i,n){
        if(hp[i] + dp[pos[i].fi][pos[i].se] > 0){
            ans += hp[i] + dp[pos[i].fi][pos[i].se];
        }
    }
    cout << ans << endl;
    return 0;
}