N,K=map(int,input().split())

XY=[[0]*3000 for i in range(3000)]

for i in range(N):
    x,y,hp=map(int,input().split())
    XY[x+550][y+550]=hp

S=[[0]*3000 for i in range(3000)]

for i in range(K):
    ax,ay,w,h,d=map(int,input().split())

    S[ax+550][ay+550]+=d
    S[ax+550+w+1][ay+550]-=d
    S[ax+550][ay+550+h+1]-=d
    S[ax+550+w+1][ay+550+h+1]+=d

for i in range(1,3000):
    for j in range(3000):
        S[i][j]+=S[i-1][j]

for i in range(3000):
    for j in range(1,3000):
        S[i][j]+=S[i][j-1]

ANS=0
for i in range(3000):
    for j in range(3000):
        if XY[i][j]>0 and XY[i][j]-S[i][j]>0:
            ANS+=XY[i][j]-S[i][j]

print(ANS)