import sys
input = sys.stdin.readline

class Accumulate2D:
    def __init__(self, A):
        self.H = len(A)
        self.W = len(A[0])
        self.Ac = [[0] * (self.W + 1) for _ in range(self.H + 1)]
        for i in range(1, self.H + 1):
            for j in range(1, self.W + 1):
                self.Ac[i][j] = self.Ac[i - 1][j] + self.Ac[i][j - 1] - self.Ac[i - 1][j - 1] + A[i - 1][j - 1] 

    def calc_sum(self, A, B, C, D):
        """
        A <= x < C, B <= y < Dの範囲の和を求める。
        """
        return self.Ac[C][D] - self.Ac[C][B] - self.Ac[A][D] + self.Ac[A][B]
    
    
N, K = map(int, input().split())
X, Y, HP = [0] * N, [0] * N, [0] * N
for i in range(N):
    X[i], Y[i], HP[i] = map(int, input().split())
    
S = [[0] * 2005 for _ in range(2005)]
geta = 500
for i in range(K):
    x, y, w, h, d = map(int, input().split())
    x, y = x + geta, y + geta
    S[x][y] += d
    S[x + w + 1][y] -= d
    S[x][y + h + 1] -= d
    S[x + w + 1][y + h + 1] += d
    
G = Accumulate2D(S)
ans = 0
for x, y, hp in zip(X, Y, HP):
    x, y = x + 1, y + 1
    ans += max(0, hp - G.Ac[x + geta][y + geta])
    
print(ans)