from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

N,K = inpl()
W,H = 1010,1010
monster = [inpl() for i in range(N)]
attack = [inpl() for i in range(K)]
MAP = [[0]*W for i in range(H)]

for x,y,w,h,D in attack:
    x += W//2
    y += H//2
    MAP[y][x] += D
    MAP[y][min(W-1,x+w+1)] -= D
    MAP[min(H-1,y+h+1)][x] -= D
    MAP[min(H-1,y+h+1)][min(W-1,x+w+1)] += D

for y in range(H):
    tmp = 0
    for x in range(W):
        tmp += MAP[y][x]
        MAP[y][x] = tmp

for x in range(H):
    tmp = 0
    for y in range(W):
        tmp += MAP[y][x]
        MAP[y][x] = tmp

ans = 0
for x,y,hp in monster:
    ans += max(hp - MAP[y+H//2][x+W//2],0)
print(ans)