#include <bits/stdc++.h>
using namespace std;
const int N = 52, M = 500005;
const long long INF = (long long)1ll << 50, INF2 = (long long)1ll << 30;
struct edge {
  int v, nt;
  long long w;
} e[M << 1];
void rd(int &x) {
  char c = getchar();
  x = 0;
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) x = x * 10 + c - 48, c = getchar();
}
int h[N * 200], cnt = 1;
inline void add(int u, int v, long long w) {
  e[++cnt] = (edge){v, h[u], w};
  h[u] = cnt;
  e[++cnt] = (edge){u, h[v], 0};
  h[v] = cnt;
}
int q1[N * 200], hd, tl;
int d[N * 200], s, t, n, m, cur[N * 200];
int bfs(int s, int t) {
  memset(d, -1, sizeof(d));
  d[s] = 0;
  hd = tl = 1;
  q1[1] = s;
  while (hd <= tl) {
    int u = q1[hd];
    for (int i = h[u]; i; i = e[i].nt) {
      int v = e[i].v;
      if (e[i].w > 0 && d[v] == -1) {
        d[v] = d[u] + 1;
        q1[++tl] = v;
      }
    }
    ++hd;
  }
  return d[t] != -1;
}
long long dinic(int u, long long a) {
  if (u == t || a == 0) return a;
  long long minf = 0, f = 0;
  for (int &i = cur[u]; i; i = e[i].nt) {
    int v = e[i].v;
    if (d[v] == d[u] + 1) {
      minf = dinic(v, min(a, e[i].w));
      if (minf > 0) {
        e[i].w -= minf;
        e[i ^ 1].w += minf;
        a -= minf;
        f += minf;
        if (!a) break;
      }
    }
  }
  return f;
}
int dd[N][210], gt = 0;
long long maxflow(int s, int t) {
  long long res = 0;
  while (bfs(s, t)) {
    for (int i = 0; i <= gt; i++) cur[i] = h[i];
    res += dinic(s, INF);
  }
  return res;
}
long long A[N], B[N], C[N];
int x, y, z;
int l[N], r[N], ct[N];
inline long long cal(int i, int x) {
  return 1ll * A[i] * x * x + 1ll * B[i] * x + C[i];
}
int main() {
  scanf("%d%d", &n, &m);
  s = 0;
  t = gt = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%I64d%I64d%I64d", &A[i], &B[i], &C[i]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &l[i], &r[i]);
    add(s, gt + 1, INF);
    for (int j = l[i]; j <= r[i]; j++) {
      dd[i][j - l[i]] = ++gt;
      add(gt, gt + 1, INF2 - cal(i, j));
    }
    dd[i][r[i] - l[i] + 1] = ++gt;
    add(gt, t, INF);
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d%d%d", &x, &y, &z);
    for (int j = max(l[y], l[x] - z); j <= min(r[y], r[x] - z) + 1; j++) {
      add(dd[x][j + z - l[x]], dd[y][j - l[y]], INF);
    }
  }
  printf("%I64d", 1ll * INF2 * n - maxflow(s, t));
  return 0;
}
