#include <bits/stdc++.h>
inline int getint() {
  register char ch;
  register bool neg = false;
  while (!isdigit(ch = getchar())) neg |= ch == '-';
  register int x = ch ^ '0';
  while (isdigit(ch = getchar())) x = (((x << 2) + x) << 1) + (ch ^ '0');
  return neg ? -x : x;
}
const int N = 51, V = 1e4 + 1, E = 1e5 + 1;
struct Edge {
  int from, to, remain, next;
};
Edge e[E];
int h[V], sz, cnt;
inline void add_edge(const int &u, const int &v, const int &w) {
  e[sz] = (Edge){u, v, w, h[u]};
  h[u] = sz++;
  e[sz] = (Edge){v, u, 0, h[v]};
  h[v] = sz++;
}
struct Func {
  int a, b, c;
  int operator()(const int &x) const { return a * x * x + b * x + c; }
};
Func f[N];
int l[N], r[N];
int lev[V], s, t, cur[V];
inline void bfs() {
  memset(lev, -1, sizeof lev);
  lev[s] = 0;
  std::queue<int> q;
  q.push(s);
  while (!q.empty()) {
    const int &x = q.front();
    for (register int i = h[x]; ~i; i = e[i].next) {
      const int &y = e[i].to, &r = e[i].remain;
      if (r && !~lev[y]) {
        lev[y] = lev[x] + 1;
        q.push(y);
      }
    }
    q.pop();
  }
}
int dfs(const int &x, const int &flow) {
  if (x == t) return flow;
  for (int &i = cur[x]; ~i; i = e[i].next) {
    const int &y = e[i].to;
    if (e[i].remain && lev[y] > lev[x]) {
      if (int d = dfs(y, std::min(flow, e[i].remain))) {
        e[i].remain -= d;
        e[i ^ 1].remain += d;
        return d;
      }
    }
  }
  return 0;
}
inline int dinic() {
  int maxflow = 0;
  for (;;) {
    bfs();
    if (!~lev[t]) break;
    memcpy(cur, h, sizeof h);
    while (int flow = dfs(s, INT_MAX)) {
      maxflow += flow;
    }
  }
  return maxflow;
}
std::map<int, int> node[N];
int main() {
  memset(h, -1, sizeof h);
  const int n = getint(), m = getint();
  for (register int i = 1; i <= n; i++) {
    const int a = getint(), b = getint(), c = getint();
    f[i] = (Func){a, b, c};
  }
  cnt = 1;
  s = cnt++;
  for (register int i = 1; i <= n; i++) {
    l[i] = getint(), r[i] = getint();
    for (register int j = l[i] - 1; j <= r[i]; j++) {
      node[i][j] = cnt++;
    }
  }
  const int M = INT_MAX / n;
  for (register int i = 1; i <= n; i++) {
    add_edge(s, node[i][l[i] - 1], INT_MAX);
    for (register int j = l[i]; j <= r[i]; j++) {
      add_edge(node[i][j - 1], node[i][j], M - f[i](j));
    }
    add_edge(node[i][r[i]], t, INT_MAX);
  }
  for (register int i = 0; i < m; i++) {
    const int u = getint(), v = getint(), d = getint();
    for (register int j = std::max(l[u], l[v] + d) - 1;
         j <= std::min(r[u], r[v] + d); j++) {
      add_edge(node[u][j], node[v][j - d], INT_MAX);
    }
  }
  printf("%d\n", M * n - dinic());
  return 0;
}
