// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

ll a[3012][3011];
int base = 503;

struct mon{
  int x, y, h;
  mon(int x, int y, int h): x(x), y(y), h(h){}
  mon(){}
};

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<mon> vec(n);
  rep(i, n){
    int x, y, h;
    cin >> x >> y >> h;
    vec[i] = mon(x, y, h);
  }
  rep(i, k){
    int x, y, w, h, d;
    cin >> x >> y >> w >> h >> d;
    a[x+base][y+base] += d;
    a[x+base][y+base+h+1] -= d;
    a[x+base+w+1][y+base] -= d;
    a[x+base+w+1][y+base+h+1] += d;
  }
  FOR(i, 1, 1020){
    rep(j, 1020){
      a[i][j] += a[i-1][j];
    }
  }
  rep(i, 1020){
    FOR(j, 1, 1020){
      a[i][j] += a[i][j-1];
    }
  }
  ll res = 0;
  rep(i, n){
    res += max(0LL, vec[i].h - a[vec[i].x+base][vec[i].y+base]);
  }
  cout << res << endl;
	return 0;
}