//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N = 1e5 + 10;
const int O = 500;

//head

int n, k;
int x[N], y[N], hp[N];
int field[1002][1002];
int ans;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k;
  rep(i, n) cin >> x[i] >> y[i] >> hp[i];
  rep(i, k) {
    int x, y, w, h, d;
    cin >> x >> y >> w >> h >> d;
    if(x+w > 500) w = 500-x;
    if(y+h > 500) h = 500-y;
    x += O;
    y += O;
    field[x][y] += d;
    field[x][y+h+1] -= d;
    field[x+w+1][y] -= d;
    field[x+w+1][y+h+1] += d;
  }
  rep(i, 1000) rep(j, 1001) {
    field[i+1][j] += field[i][j];
  }
  rep(i, 1001) rep(j, 1000) {
    field[i][j+1] += field[i][j];
  }
  rep(i, n) {
    ans += max(0, hp[i]-field[x[i]+O][y[i]+O]);
  }

  cout << ans << endl;
}