ADD = 500; UB = ADD*2+1
N,K=map(int,raw_input().split())
field = [[0]*(UB+1) for i in xrange(UB+1)]
enemy = [map(int,raw_input().split()) for i in xrange(N)]
for i in xrange(K):
	x,y,w,h,d = map(int,raw_input().split())
	x += ADD; y += ADD
	r = min(UB,x+w+1);t = min(UB,y+h+1)
	field[y][x] += d; field[y][r] -= d
	field[t][x] -= d; field[t][r] += d
for h in xrange(UB+1):
	for w in xrange(UB):
		field[h][w+1] += field[h][w]
for w in xrange(UB+1):
	for h in xrange(UB):
		field[h+1][w] += field[h][w]
print sum(max(0,hp-field[y+ADD][x+ADD]) for x,y,hp in enemy)