#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<P, ll> PP;

int n,k;
vector<PP> vec;
ll imos[2010][2010];

void solve(){
  cin >> n >> k;
  rep(i,n){
    int x,y,hp;
    cin >> x >> y >> hp;
    vec.push_back(PP(P(x+500,y+500),hp));
  }
  rep(i,k){
    int x,y,w,h,d;
    cin >> x >> y >> w >> h >> d;
    imos[x+500][y+500]+=d;
    imos[x+500+w+1][y+500]+=-d;
    imos[x+500][y+500+h+1]+=-d;
    imos[x+500+w+1][y+500+h+1]+=d;
  }
  rep(i,2009){
    rep(j,2009){
      imos[i][j+1]+=imos[i][j];
    }
  }
  rep(j,2009){
    rep(i,2009){
      imos[i+1][j]+=imos[i][j];
    }
  }
  ll ans=0;
  rep(i,n){
    int x=vec[i].first.first,y=vec[i].first.second,hp=vec[i].second;
    //cout << x << " " << y << " " << hp << " " << imos[x][y] << endl;
    if (imos[x][y]<hp) ans+=hp-imos[x][y];
  }
  cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}