#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxx=1001, maxy=1001;
int b[maxx+2][maxy+2];

int main()
{
    int n, k;
    while (~scanf("%d%d", &n, &k)) {
        memset(b, 0, sizeof(b));
        vector<tuple<int, int, int>> v;
        while (n--) {
            int x, y, hp; scanf("%d%d%d", &x, &y, &hp);
            x+=500, y+=500;
            v.emplace_back(x, y, hp);
        }
        while (k--) {
            int x, y, w, h, d; scanf("%d%d%d%d%d", &x, &y, &w, &h, &d);
            x+=500, y+=500;
#define min(a, b) (a<b?a:b)
            int xx=min(x+w+1, maxx), yy=min(y+h+1, maxy);
            b[x][y]-=d;
            b[x][yy]+=d;
            b[xx][y]+=d;
            b[xx][yy]-=d;
        }

        for(int x=0;x<maxx;++x)
            for(int y=1;y<maxy;++y)
                b[x][y]+=b[x][y-1];
        for(int x=1;x<maxx;++x)
            for(int y=0;y<maxy;++y)
                b[x][y]+=b[x-1][y];

        int res=0;
        for(auto& p: v) {
            int x, y, hp;
            tie(x, y, hp)=p;
            if (hp+b[x][y]>0)
            res+=hp+b[x][y];
        }
        printf("%d\n", res);
    }
}