#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int N,K;
pair <pair <int,int>,ll > enemy[100100];
ll XY[1110][1110];// -500 ~  500 => 0 ~ 1000
int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N >> K;
  rep(i,N){
    cin >> enemy[i].fir.fir >> enemy[i].fir.sec >> enemy[i].sec;
    enemy[i].fir.fir += 500;
    enemy[i].fir.sec += 500;
  }
  rep(i,K){
    int x,y,w,h;
    ll d;
    cin >> x >> y >> w >> h >> d;
    x += 500;
    y += 500;
    XY[x][y] += d;
    XY[x][min(1010,y+h)+1] -= d;
    XY[min(1010,x+w)+1][y] -= d;
    XY[min(1010,x+w)+1][min(1010,y+h)+1] += d;
  }

  for(int x = 0;x <= 1010;x++){
    for(int y = 1;y <= 1010;y++){
      XY[x][y] += XY[x][y-1];
    }
  }
  for(int y = 0; y <= 1010;y++){
    for(int x = 1;x <= 1010;x++){
      XY[x][y] += XY[x-1][y];
      //DEBUG3(x,y,XY[x][y]);
    }
  }

  ll ans = 0;
  rep(i,N){
    ll now_atack = XY[enemy[i].fir.fir][enemy[i].fir.sec];
    //DEBUG2(now_atack,enemy[i].sec);
    ans += max(0LL,enemy[i].sec-now_atack);
  }
  cout << ans << endl;
  return 0;
}