package yukicoder;
import java.util.Scanner;
public class Main{
	public static void main(String[] args)throws Exception{
		new Main().solve();
	}
	void solve(){
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int k=sc.nextInt();
		int[][] table=new int[2000][2000];
		for(int i=0;i<n;i++){
			int x=sc.nextInt()+500;
			int y=sc.nextInt()+500;
			int hp=sc.nextInt();
			table[y][x]+=hp;
		}
		int[][] damage=new int[2000][2000];
		for(int i=0;i<k;i++){
			int x=sc.nextInt()+500;
			int y=sc.nextInt()+500;
			int w=sc.nextInt();
			int h=sc.nextInt();
			int d=sc.nextInt();
			damage[y][x]+=d;damage[y][x+w+1]=-d;
			damage[y+h+1][x]-=d;damage[y+h+1][w+x+1]+=d;
		}
		for(int i=0;i<=1000;i++){
			for(int j=1;j<=1000;j++){
				damage[i][j]+=damage[i][j-1];
			}
		}
		for(int i=0;i<=1000;i++){
			for(int j=1;j<=1000;j++){
				damage[j][i]+=damage[j-1][i];
			}
		}
		long res=0;
		for(int i=0;i<=1000;i++){
			for(int j=0;j<=1000;j++){
				if(table[i][j]>damage[i][j])res+=table[i][j]-damage[i][j];
			}
		}
		System.out.println(res);
	}
}