import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy


n, k = map(int, input().split())
M = 500
SIZE = 1002
f = [[0 for _ in range(SIZE + 1)] for _ in range(SIZE + 1)]
im = [[0 for _ in range(SIZE + 1)] for _ in range(SIZE + 1)]


for _ in range(n):
  x, y, h = map(int, input().split())
  f[y + M][x + M] = h

for _ in range(k):
  ax, ay, w, h, d = map(int, input().split())
  mx = min(ax + M + w + 1, SIZE)
  my = min(ay + M + h + 1, SIZE)

  im[ay + M][ax + M] += d
  im[my][ax + M] -= d
  im[ay + M][mx] -= d
  im[my][mx] += d

for y in range(SIZE + 1):
  for x in range(SIZE):
    im[y][x + 1] += im[y][x]

for x in range(SIZE + 1):
  for y in range(SIZE):
    im[y + 1][x] += im[y][x]

ans = 0
for x in range(SIZE + 1):
  for y in range(SIZE + 1):
    ans += max(f[y][x] - im[y][x], 0)

print(ans)