////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
#include <type_traits>
#include <mutex>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 28)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

inline int sign_of(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }
inline bool inRange(int val, int min, int max) { return val >= min && val < max; }
inline bool inRange(double val, double min, double max) { return val - min > -EPS && val - max < EPS; }
inline bool inRange(int x, int y, int W, int H) { return x >= 0 && x < W && y >= 0 && y < H; } // W,H含まない

template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };

//// i/o helper ////

namespace std {
template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
template <class T1, class T2> inline ostream & operator << (ostream &out, const pair<T1, T2> &p) { out << p.first << " " << p.second; return out; }
}
template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T> struct iter_pair_t { T beg, end; };
template <class T> iter_pair_t<T> iter_pair(T beg, T end) { return iter_pair_t<T>{beg, end}; }
template <class T> ostream & operator << (ostream &out, const iter_pair_t<T> &v)
{
	std::copy(v.beg, v.end, ostream_iterator<typename decltype(v.beg)::reference>(out, " "));
	return out;
}
template <class T1> ostream & operator << (ostream &out, const vector<T1> &v) { return out << iter_pair(begin(v), end(v)); }
template <class T1> ostream & operator << (ostream &out, const set<T1> &v) { return out << iter_pair(begin(v), end(v)); }
template <class T1, class T2> ostream & operator << (ostream &out, const map<T1,T2> &v) { return out << iter_pair(begin(v), end(v)); }

struct _Reader { istream &cin;template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { ostream &cout; bool f{false	}; template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; (_Reader{cin}), __VA_ARGS__
#define WRITE(...) (_Writer{cout}), __VA_ARGS__; cout << endl
#define DEBUG(...) (_Writer{cerr}), __VA_ARGS__; cerr << endl

void solve();
int main()
{
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cout << setprecision(std::numeric_limits<double>::max_digits10);
	solve();
	
	return 0;
}


////////////////////
/// template end ///
////////////////////

void solve()
{
	READ(int, N, K);

	vector<int> Xmp;
	vector<int> Ymp;
	struct Enemy { int x, y, hp; };
	struct Attack { int x, y, w, h, d; };
	vector<Enemy> E;
	vector<Attack> A;

	// read Enemies
	{
		E.reserve(N);
		set<int> Xst;
		set<int> Yst;
		REP(i, N)
		{
			READ(int, x, y, hp);
			x += 500;
			y += 500;
			Xst.insert(x);
			Yst.insert(y);
			E.push_back(Enemy{ x,y,hp });
		}
		{
			Xmp.reserve(1002);
			int x = 0;
			REP(i, 1002)
			{
				Xmp.push_back(x);
				if (Xst.count(i)) { x++; }
			}

			Ymp.reserve(1002);
			int y = 0;
			REP(i, 1002)
			{
				Ymp.push_back(y);
				if (Yst.count(i)) { y++; }
			}
		}
	}

	// read Attacks
	{
		A.reserve(K);
		REP(i, K)
		{
			READ(int, x, y, w, h, d);
			x += 500;
			y += 500;
			A.push_back(Attack{ x,y,w,h,d });
		}

	}


	int W = Xmp.back() + 1;
	int H = Ymp.back() + 1;
	vevector<long> dmgTotal(W, H);
	for (const auto &a : A)
	{
		int x = Xmp[a.x];
		int y = Ymp[a.y];
		int x2 = Xmp[min(a.x + a.w + 1, 1001)];
		int y2 = Ymp[min(a.y + a.h + 1, 1001)];

		dmgTotal[x][y] += a.d;
		dmgTotal[x][y2] += -a.d;
		dmgTotal[x2][y] += -a.d;
		dmgTotal[x2][y2] += a.d;
	}

	REP(i,H)
	{
		long d = 0;
		REP(j, W)
		{
			d += dmgTotal[j][i];
			dmgTotal[j][i] = d;
		}
	}

	REP(j, W)
	{
		long d = 0;
		REP(i, H)
		{
			d += dmgTotal[j][i];
			dmgTotal[j][i] = d;
		}
	}

	long totalHp = 0;
	for(const auto &e : E)
	{
		int x = Xmp[e.x];
		int y = Ymp[e.y];

		totalHp += max<long>(e.hp - dmgTotal[x][y], 0);
	}

	WRITE(totalHp);
}