dp = [[0 for i in range(1010)] for j in range(1010)]
n, k = map(int, input().split())

x = [0] * n
y = [0] * n
hp = [0] * n
for i in range(n):
    xi, yi, hpi = map(int, input().split())
    x[i] = xi + 501
    y[i] = yi + 501
    hp[i] = hpi

for i in range(k):
    ax, ay, w, h, d = map(int, input().split())
    ax += 501
    ay += 501
    bx = min(1005, ax + w + 1)
    by = min(1005, ay + h + 1)
    dp[ay][ax] += d
    dp[ay][bx] -= d
    dp[by][ax] -= d
    dp[by][bx] += d
    
for i in range(1, 1006):
    for j in range(1, 1006):
        dp[i][j] += dp[i][j - 1]
        
for j in range(1, 1006):
    for i in range(1, 1006):
        dp[i][j] += dp[i - 1][j]
        
ans = 0
for i in range(n):
    ans += max(0, hp[i] - dp[y[i]][x[i]])
    
print(ans)