n,k = map(int,input().split())
M = 1000

enemy = [[0]*(2*M+5) for i in range(2*M+5)]
for i in range(n):
    x,y,hp = map(int,input().split())
    x,y = x+505,y+505
    enemy[x][y] = hp

attack = [[0]*(2*M+5) for i in range(2*M+5)]
for i in range(k):
    x,y,w,h,d = map(int,input().split())
    x,y = x+505,y+505
    attack[x][y] += d
    attack[x+w+1][y] -= d
    attack[x][y+h+1] -= d
    attack[x+w+1][y+h+1] += d

for i in range(2*M+1):
    for j in range(2*M+1):
        attack[i][j+1] += attack[i][j]

for i in range(2*M+1):
    for j in range(2*M+1):
        attack[i+1][j] += attack[i][j]

ans = 0
for i in range(2*M+5):
    for j in range(2*M+5):
        ans += max(enemy[i][j]-attack[i][j],0)
print(ans)