#include<cstdio>
#include<vector>


using namespace std;


struct enemy_t
{
	int x, y, hp;
};

vector<enemy_t> ene;


int main(void)
{
	int i, n, k;
	int x, y, w, h, d;
	int ans;
	vector<vector<int> > f;

	while(scanf("%d%d", &n, &k)==2)
	{
		f.clear();
		f.resize(1001);
		for(auto& fe: f) fe.resize(1001);

		ene.resize(n);
		for(i=0;i<n;i++)
		{
			scanf("%d%d%d", &x, &y, &ene[i].hp);
			ene[i].x=x+500;
			ene[i].y=y+500;
		}

		for(i=0;i<k;i++)
		{
			scanf("%d%d%d%d%d", &x, &y, &w, &h, &d);
			x+=500;
			y+=500;
			f[y][x]+=d;
			if(x+w+1<=1000)                f[y    ][x+w+1]-=d;
			if(y+h+1<=1000)                f[y+h+1][x    ]-=d;
			if(x+w+1<=1000 && y+h+1<=1000) f[y+h+1][x+w+1]+=d;
		}

		for(y=0;y<=1000;y++)
		{
			for(x=1;x<=1000;x++)
			{
				f[y][x]+=f[y][x-1];
			}
		}
		for(y=1;y<=1000;y++)
		{
			for(x=0;x<=1000;x++)
			{
				f[y][x]+=f[y-1][x];
			}
		}

		ans=0;
		for(i=0;i<n;i++)
		{
			enemy_t& t=ene[i];
			ans+=max(0, t.hp-f[t.y][t.x]);
		}
/*
for(auto t: ene) printf("%d ", t.hp);
printf("\n");
*/
		printf("%d\n", ans);
	}
	return 0;
}