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

template<typename T>
struct Imos2D {
    vector<vector<T>> imos;
    Imos2D(int h = 0, int w = 0) : imos(h + 2, vector<T>(w + 2)) { }
    void add(int i, int j, T x) { imos[i + 1][j + 1] += x; }
    void add_rect(int i1, int j1, int i2, int j2, T x = 1) {
        add(i1, j1, +x); add(i1, j2, -x); add(i2, j1, -x); add(i2, j2, +x);
    }
    void build() {
        int H = imos.size(), W = imos[0].size();
        for (int i = 1; i < H; i++) for (int j = 1; j < W; j++) {
            imos[i][j] += imos[i][j - 1] + imos[i - 1][j] - imos[i - 1][j - 1];
        }
    }
    T get(int i, int j) { return imos[i + 1][j + 1]; }
    T diff(int si, int sj, int ti, int tj) {        // [si, ti) x [sj, tj)
        return imos[ti][tj] - imos[ti][sj] - imos[si][tj] + imos[si][sj];
    }
};

int main() {
    const int OFS = 500;
    Imos2D<int> imos(1001, 1001);
    int n, k; cin >> n >> k;
    vector<int> x(n), y(n), hp(n);
    for (int i = 0; i < n; i++) cin >> x[i] >> y[i] >> hp[i];
    while (k--) {
        int i, j, w, h, d; cin >> i >> j >> w >> h >> d;
        i += OFS, j += OFS;
        int i2 = min(1000, i + w);
        int j2 = min(1000, j + h);
        imos.add_rect(i, j, i2 + 1, j2 + 1, d);
    }
    imos.build();
    int rest = 0;
    for (int i = 0; i < n; i++) {
        rest += max(0, hp[i] - imos.get(x[i] + OFS, y[i] + OFS));
    }
    cout << rest << endl;
    return 0;
}