#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

tuple<int,int,int> enemy[100000];
int field[2000][2000];

int main() {
    int i, j, n, k, ans;
    cin >> n >> k;
    rep (i,n) {
        int x, y, hp;
        cin >> x >> y >> hp;
        enemy[i] = make_tuple(x,y,hp);
    }
    rep (i,k) {
        int ax, ay, w, h, d;
        cin >> ax >> ay >> w >> h >> d;
        ax += 500;
        ay += 500;
        field[ax][ay] += d;
        field[ax+w+1][ay] -= d;
        field[ax][ay+h+1] -= d;
        field[ax+w+1][ay+h+1] += d;
    }
    rep (i,1001) rep (j,1000) field[i][j+1] += field[i][j];
    rep (j,1001) rep (i,1000) field[i+1][j] += field[i][j];
    ans = 0;
    rep (i,n) {
        int x, y, hp;
        tie(x,y,hp) = enemy[i];
        ans += max(0,hp-field[x+500][y+500]);
    }
    cout << ans << endl;
    return 0;
}