n, k = map(int, input().split())
offset = 500

m = 1001
dp = [[0 for _ in range(m + 1)] for _ in range(m + 1)]
enems = []
for _ in range(n):
  xi, yi, hpi = map(int, input().split())
  xi += offset
  yi += offset
  enems.append((xi, yi, hpi))

for _ in range(k):
  axi, ayi, wi, hi, di = map(int, input().split())
  axi += offset
  ayi += offset
  bxi = axi + wi
  byi = ayi + hi
  dp[axi][ayi] += di
  dp[axi][min(byi + 1, m)] -= di
  dp[min(bxi + 1, m)][ayi] -= di
  dp[min(bxi + 1, m)][min(byi + 1, m)] += di

for x in range(m + 1):
  for y in range(1, m + 1):
    dp[x][y] += dp[x][y - 1]

for y in range(m + 1):
  for x in range(1, m + 1):
    dp[x][y] += dp[x - 1][y]

ans = 0
for xi, yi, hpi in enems:
  ans += max(0, hpi - dp[xi][yi])

print(ans)