#include <iostream>
using namespace std;

typedef long long ll;

const int kMAX_WIDTH = 2100;
const int kMAX_HEIGHT = 2100;
const int kMAX_N = 100010;

ll field[kMAX_WIDTH][kMAX_HEIGHT];

int N, K;

int X[kMAX_N], Y[kMAX_N], HP[kMAX_N];

void Add(int x, int y, int hp) {
    field[x + kMAX_WIDTH / 2][y + kMAX_HEIGHT / 2] += hp;
}

ll Get(int x, int y) {
    return field[x + kMAX_WIDTH / 2][y + kMAX_HEIGHT / 2];
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> K;

    for (int i = 0; i < N; i++) {
        cin >> X[i] >> Y[i] >> HP[i];
    }

    for (int i = 0; i < K; i++) {
        int ax, ay, w, h, d;
        cin >> ax >> ay >> w >> h >> d;
        Add(ax, ay, d);
        Add(ax + w + 1, ay, -d);
        Add(ax, ay + h + 1, -d);
        Add(ax + w + 1, ay + h + 1, d);
    }

    for (int x = 0; x < kMAX_WIDTH; x++) {
        for (int y = 1; y < kMAX_HEIGHT; y++) {
            field[x][y] += field[x][y - 1];
        }
    }

    for (int y = 0; y < kMAX_HEIGHT; y++) {
        for (int x = 1; x < kMAX_WIDTH; x++) {
            field[x][y] += field[x - 1][y];
        }
    }

    ll ans = 0;
    for (int i = 0; i < N; i++) {
        if (Get(X[i], Y[i]) < HP[i]) {
            ans += HP[i] - Get(X[i], Y[i]);
        }
    }
    cout << ans << endl;

    return 0;
}