#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

template <typename T>
T getSum2D(const vector<vector<T>>& sum, int y1, int y2, int x1, int x2) {
    // y1--;
    // x1--;
    return sum[y2][x2] - sum[y1][x2] - sum[y2][x1] + sum[y1][x1];
}
template <typename T>
void preCalcSum2D(vector<vector<T>>& sum) {
    int H = sum.size(), W = sum[0].size();
    for (int i = 1; i < H; i++) {
        for (int j = 0; j < W; j++) {
            sum[i][j] += sum[i - 1][j];
        }
    }
    for (int i = 0; i < H; i++) {
        for (int j = 1; j < W; j++) {
            sum[i][j] += sum[i][j - 1];
        }
    }
}

void solve() {
    int n, k;
    cin >> n >> k;
    const int g = 510;
    const int ma = 4040;
    vector<vl> d(ma, vl(ma, 0));
    vector<vl> s(ma, vl(ma, 0));
    rep(i, n) {
        int x, y, h;
        cin >> x >> y >> h;
        d[y + g][x + g] = h;
    }
    rep(i, k) {
        int x, y, w, h, d;
        cin >> x >> y >> w >> h >> d;
        s[y + g][x + g] += d;
        s[y + g + h + 1][x + g + w + 1] += d;
        s[y + g + h + 1][x + g] -= d;
        s[y + g][x + g + w + 1] -= d;
    }
    preCalcSum2D(s);
    ll ans = 0;
    rep(i, ma) rep(j, ma) {
        if (max(0LL, s[i][j]) < d[i][j]) {
            ans += d[i][j] - max(0LL, s[i][j]);
        }
    }
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}