//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//g++ yarudake.cpp -std=c++17 -I .
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, k;
    cin >> n >> k;
    vector<vector<ll>> d(1001, vector<ll>(1001, 0));
    vector<ll> x(n), y(n), h(n);
    rep(i, n) cin >> x[i] >> y[i] >> h[i];
    rep(i, n)
    {
        x[i] += 500;
        y[i] += 500;
    }
    rep(i, k)
    {
        ll a, b, ww, hh, dd;
        cin >> a >> b >> ww >> hh >> dd;
        a += 500;
        b += 500;
        rep(j, ww + 1)
        {
            if (a + j <= 1000)
            {
                d[a + j][b] += dd;
                if (b + hh + 1 <= 1000)
                    d[a + j][b + hh + 1] -= dd;
            }
        }
    }
    rep(i, 1001)
    {
        rep(j, 1000)
        {
            d[i][j + 1] += d[i][j];
        }
    }
    /*
    rep(i, 10)
    {
        rep(j, 10)
        {
            cout << d[i + 500 - 5][j + 500 - 5] << " ";
        }
        cout << "\n";
    }*/
    ll ans = 0;
    rep(i, n)
    {
        ans += max(ll(0), h[i] - d[x[i]][y[i]]);
    }
    cout << ans << "\n";
}