import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum LIM = 505;

int N, K;
int[] X, Y, HP;
int[] AX, AY, W, H, D;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      K = readInt();
      X = new int[N];
      Y = new int[N];
      HP = new int[N];
      foreach (i; 0 .. N) {
        X[i] = readInt();
        Y[i] = readInt();
        HP[i] = readInt();
      }
      AX = new int[K];
      AY = new int[K];
      W = new int[K];
      H = new int[K];
      D = new int[K];
      foreach (k; 0 .. K) {
        AX[k] = readInt();
        AY[k] = readInt();
        W[k] = readInt();
        H[k] = readInt();
        D[k] = readInt();
      }
      
      auto sum = new int[][](2 * LIM + 2, 2 * LIM + 2);
      foreach (k; 0 .. K) {
        const x0 = LIM + AX[k];
        const x1 = LIM + min(AX[k] + W[k], LIM) + 1;
        const y0 = LIM + AY[k];
        const y1 = LIM + min(AY[k] + H[k], LIM) + 1;
        sum[x0][y0] += D[k];
        sum[x1][y0] -= D[k];
        sum[x0][y1] -= D[k];
        sum[x1][y1] += D[k];
      }
      foreach (x; 1 .. 2 * LIM + 2) foreach (y; 0 .. 2 * LIM + 2) {
        sum[x][y] += sum[x - 1][y];
      }
      foreach (x; 0 .. 2 * LIM + 2) foreach (y; 1 .. 2 * LIM + 2) {
        sum[x][y] += sum[x][y - 1];
      }
      
      long ans;
      foreach (i; 0 .. N) {
        const x = LIM + X[i];
        const y = LIM + Y[i];
        ans += max(HP[i] - sum[x][y], 0);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}