#include <bits/stdc++.h>
using namespace std;
const int N = 200010, C = 500000, inf = 1 << 30;
int n, m, cnt = 1, cnt1, G[N];
struct iedge {
  int nx, t, f;
} E[N << 1];
int S, T;
int a[N], b[N], c[N], l[N], r[N];
int p[55][210];
inline int f(int x, int y) { return a[x] * y * y + b[x] * y + c[x]; }
inline void addedge(int x, int y, int f) {
  E[++cnt].t = y;
  E[cnt].nx = G[x];
  E[cnt].f = f;
  G[x] = cnt;
  E[++cnt].t = x;
  E[cnt].nx = G[y];
  E[cnt].f = 0;
  G[y] = cnt;
}
int dis[N];
queue<int> Q;
inline bool bfs() {
  while (!Q.empty()) Q.pop();
  memset(dis, -1, sizeof(dis));
  dis[S] = 0;
  Q.push(S);
  while (!Q.empty()) {
    int x = Q.front();
    Q.pop();
    for (int i = G[x]; i; i = E[i].nx)
      if (E[i].f && dis[E[i].t] == -1) {
        dis[E[i].t] = dis[x] + 1;
        Q.push(E[i].t);
        if (E[i].t == T) return true;
      }
  }
  return false;
}
int cur[N];
int dfs(int x, int f) {
  if (x == T || !f) return f;
  int used = 0, w;
  for (int &i = cur[x]; i; i = E[i].nx)
    if (E[i].f && dis[E[i].t] == dis[x] + 1) {
      w = dfs(E[i].t, min(E[i].f, f - used));
      E[i].f -= w;
      E[i ^ 1].f += w;
      if ((used += w) == f) return f;
    }
  return used;
}
int main() {
  scanf("%d%d", &n, &m);
  T = n * 210;
  for (int i = 1; i <= n; i++) scanf("%d%d%d", a + i, b + i, c + i);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", l + i, r + i);
    for (int j = l[i]; j <= r[i]; j++) p[i][j + 100] = ++cnt1;
    addedge(S, p[i][l[i] + 100], C - f(i, l[i]));
    for (int j = l[i]; j < r[i]; j++)
      addedge(p[i][j + 100], p[i][j + 101], C - f(i, j + 1));
    addedge(p[i][r[i] + 100], T, inf);
  }
  for (int i = 1, u, v, d; i <= m; i++) {
    scanf("%d%d%d", &u, &v, &d);
    for (int j = l[v]; j <= r[v]; j++) {
      if (j + d > r[u]) continue;
      if (j + d >= l[u])
        addedge(p[u][j + d + 100], p[v][j + 100], inf);
      else
        addedge(S, p[v][j + 100], inf);
    }
  }
  int ans = 0;
  while (bfs()) memcpy(cur, G, sizeof(cur)), ans += dfs(S, inf);
  printf("%d\n", n * C - ans);
  return 0;
}
