#include <bits/stdc++.h>

using namespace std;

namespace {

    typedef double real;
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        auto i = vs.begin();
        os << "[" << *i;
        for (++i; i != vs.end(); ++i) os << " " << *i;
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    int N, K;
    vector<int> X, Y, HP;
    void input() {
        cin >> N >> K;
        X.resize(N);
        Y.resize(N);
        HP.resize(N);
        for (int i = 0; i < N; i++) {
            cin >> X[i] >> Y[i] >> HP[i];
        }
    }

    const int M = 500;

    void solve() {
        static int S[1511][1511];
        static int D[1511][1511];
        memset(S, 0, sizeof(S));
        memset(D, 0, sizeof(D));
        for (int k = 0; k < K; k++) {
            int x, y, w, h, d; cin >> x >> y >> w >> h >> d;
            x += M; y += M;
            for (int y1 = y; y1 <= y + h; y1++) {
                D[y1][x] += d;
                D[y1][x + w + 1] -= d;
            }
        }
        for (int y = 0; y <= 1510; y++) {
            int d = 0;
            for (int x = 0; x <= 1510; x++) {
                d += D[y][x];
                S[y][x] = d;
            }
        }

        int ans = 0;
        for (int i = 0; i < N; i++) {
            int x = X[i] + M, y = Y[i] + M, hp = HP[i];
            ans += max(0, hp - S[y][x]);
        }
        cout << ans << endl;
    }
}

int main() {
    input(); solve();
    return 0;
}