#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
#include <climits>
#include <numeric>
#include <functional>
#include <time.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; i++)
template<class T> void checkmin(T &a, T b) { if (b < a) a = b; }
template<class T> void checkmax(T &a, T b) { if (b > a) a = b; }


const int MaxRange = 1510;
const int Offset = 500;
const int MaxN = 100000;
ll bit1[MaxRange][MaxRange + 10], bit2[MaxRange][MaxRange + 10];

int N, K;
int EX[MaxN], EY[MaxN], EHP[MaxN];
int AX[MaxN], AY[MaxN], AW[MaxN], AH[MaxN], AD[MaxN];

void BITAdd(int i, ll val, ll* A) {
    for (++i; i <= MaxRange; i += i & -i) A[i] += val;
}
ll BITSum(int i, ll* A) {
    long sum = 0;
    for (++i; i > 0; i &= i - 1) sum += A[i];
    return sum;
}


void solve() {
    rep(i, K) {
        int x1 = AX[i], x2 = x1 + AW[i];
        int y1 = AY[i], y2 = y1 + AH[i];
        ll d = AD[i];
        FOR(x, x1, x2) {
            BITAdd(y1, -d * (y1 - 1), bit1[x]);
            BITAdd(y2 + 1, d * y2, bit1[x]);
            BITAdd(y1, d, bit2[x]);
            BITAdd(y2 + 1, -d, bit2[x]);
        }
    }
    ll ans = 0;
    rep(i, N) {
        int x = EX[i], y = EY[i], hp = EHP[i];
        ll d = BITSum(y, bit1[x]) + BITSum(y, bit2[x]) * y;
        d -= BITSum(y - 1, bit1[x]) + BITSum(y - 1, bit2[x]) * (y - 1);
        if (hp > d) ans += hp - d;
    }
    printf("%lld\n", ans);
}

int main() {
    scanf("%d%d", &N, &K);
    rep(i, N) {
        scanf("%d%d%d", &EX[i], &EY[i], &EHP[i]);
        EX[i] += Offset;
        EY[i] += Offset;
    }
    rep(i, K) {
        scanf("%d%d%d%d%d", &AX[i], &AY[i], &AW[i], &AH[i], &AD[i]);
        AX[i] += Offset;
        AY[i] += Offset;
    }
    solve();

    return 0;
}