#include <bits/stdc++.h>
using namespace std;
long long n, m, S, T, a[101], b[101], c[101], tot = 1, e[200001], nt[200001],
                                              hd[200001], val[200001], d[11001],
                                              q[200001];
void build(long long x, long long y, long long w) {
  tot++;
  e[tot] = y;
  val[tot] = w;
  nt[tot] = hd[x];
  hd[x] = tot;
  tot++;
  e[tot] = x;
  val[tot] = 0;
  nt[tot] = hd[y];
  hd[y] = tot;
}
long long get(long long x, long long y) {
  return -(a[x] * y * y + b[x] * y + c[x]) + 1e8;
}
long long bfs() {
  long long i, u, l = 0, r = 1;
  memset(d, 0, sizeof(d));
  d[S] = 1;
  q[1] = S;
  while (l < r) {
    u = q[++l];
    for (i = hd[u]; i; i = nt[i])
      if (!d[e[i]] && val[i]) {
        d[e[i]] = d[u] + 1;
        q[++r] = e[i];
      }
  }
  return d[T] > 0;
}
long long dfs(long long x, long long flow) {
  long long i, sum = 0, hh;
  if (x == T) return flow;
  for (i = hd[x]; i; i = nt[i])
    if (val[i] && d[e[i]] == d[x] + 1) {
      hh = dfs(e[i], min(flow, val[i]));
      flow -= hh;
      sum += hh;
      val[i] -= hh;
      val[i ^ 1] += hh;
      if (!flow) return sum;
    }
  if (!sum) d[x] = 0;
  return sum;
}
long long dinic() {
  long long flow = 0;
  while (bfs()) {
    flow += dfs(S, 1e16);
  }
  return flow;
}
int main() {
  long long i, j, x, y, w;
  scanf("%lld%lld", &n, &m);
  S = n * 202 + 1;
  T = S + 1;
  for (i = 1; i <= n; i++) {
    scanf("%lld%lld%lld", &a[i], &b[i], &c[i]);
  }
  for (i = 1; i <= n; i++) {
    scanf("%lld%lld", &x, &y);
    x += 101;
    y += 101;
    build(S, (i - 1) * 202 + 1, 1e16);
    for (j = 1; j < x; j++)
      build((i - 1) * 202 + j, (i - 1) * 202 + j + 1, 1e16);
    for (j = x; j <= y; j++)
      build((i - 1) * 202 + j, (i - 1) * 202 + j + 1, get(i, j - 101));
    for (j = y + 1; j < 202; j++)
      build((i - 1) * 202 + j, (i - 1) * 202 + j + 1, 1e16);
    build((i - 1) * 202 + 202, T, 1e16);
  }
  for (i = 1; i <= m; i++) {
    scanf("%lld%lld%lld", &x, &y, &w);
    for (j = 1; j + w <= 202; j++)
      build((x - 1) * 202 + j + w, (y - 1) * 202 + j, 1e16);
  }
  printf("%lld\n", -(dinic() - (100000000) * n));
}
