import java.io.*;
import java.util.*;
public class Main {
	static FastScanner sc;
	public static void main(String[] args) {
		sc = new FastScanner();
		int N = sc.nextInt();
		int K = sc.nextInt();
		int ene[][] = new int[1001][1001];	// 敵のHPのマップ
		int dif[][] = new int[1001][1001];	// 与ダメージのマップ
		for (int i=0; i<N; i++) {
			int x = sc.nextInt() + 500;
			int y = sc.nextInt() + 500;
			int hp = sc.nextInt();
			ene[x][y] = hp;	// -500〜500を0〜1000に
		}
		for (int i=0; i<K; i++) {
			int x = sc.nextInt() + 500;
			int y = sc.nextInt() + 500;
			int wx = sc.nextInt();
			int wy = sc.nextInt();
			int d = sc.nextInt();
			dif[x][y] = d;
			if (x+wx+1<1001 && y+wy+1<1001) dif[x+wx+1][y+wy+1] = d;
			if (x+wx+1<1001) dif[x+wx+1][y] = -d;
			if (y+wy+1<1001) dif[x][y+wy+1] = -d;
		}
		
		for (int y=0; y<1001; y++) {
			for (int x=1; x<1001; x++) {
				dif[x][y] += dif[x-1][y];
			}
		}
		for (int x=0; x<1001; x++) {
			for (int y=1; y<1001; y++) {
				dif[x][y] += dif[x][y-1];
			}
		}
		
		int ans = 0;
		for (int y=0; y<1001; y++) {
			for (int x=0; x<1001; x++) {
				if (ene[x][y]-dif[x][y]>0) ans += ene[x][y]-dif[x][y];
			}
		}
		
		System.out.println(ans);
	}
	
	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;
		
		public FastScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
		
		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}