import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,K = MI()
enemy = []
for _ in range(N):
    X,Y,HP = MI()
    enemy.append((X+500,Y+500,HP))

A = [[0]*1002 for _ in range(1002)]
for _ in range(K):
    X,Y,W,H,D = MI()
    X += 500
    Y += 500
    A[X][Y] += D
    A[X][min(Y+H+1,1001)] -= D
    A[min(X+W+1,1001)][Y] -= D
    A[min(X+W+1,1001)][min(Y+H+1,1001)] += D

for i in range(1002):
    for j in range(1,1002):
        A[i][j] += A[i][j-1]
for i in range(1,1002):
    for j in range(1002):
        A[i][j] += A[i-1][j]

ans = 0
for X,Y,HP in enemy:
    ans += max(0,HP-A[X][Y])

print(ans)