#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
namespace maxflow {
struct Edge {
  int v, c;
  Edge* next;
};
const int N = 2e4;
Edge* a[N];
Edge pool[10 * N];
Edge* last;
int d[N];
inline Edge* new_edge(int v, int c, Edge* next) {
  Edge* p = last++;
  p->v = v;
  p->c = c;
  p->next = next;
  return p;
}
inline void add_edge(int u, int v, int c) {
  a[u] = new_edge(v, c, a[u]);
  a[v] = new_edge(u, 0, a[v]);
}
inline Edge* dual(Edge* p) { return pool + ((p - pool) ^ 1); }
int augment(int u, int t, int bound) {
  if (u == t) return bound;
  int ret = 0;
  for (Edge* it = a[u]; it && ret < bound; it = it->next) {
    if (it->c && d[it->v] == d[u] + 1) {
      int aug = augment(it->v, t, min(it->c, bound - ret));
      ret += aug;
      it->c -= aug;
      dual(it)->c += aug;
    }
  }
  if (ret == 0) d[u] = -1;
  return ret;
}
bool path(int s, int t, int n) {
  fill(d, d + n, -1);
  d[s] = 0;
  queue<int> Q;
  Q.push(s);
  while (!Q.empty()) {
    int u = Q.front();
    Q.pop();
    for (Edge* it = a[u]; it; it = it->next) {
      if (it->c && d[it->v] == -1) {
        Q.push(it->v);
        d[it->v] = d[u] + 1;
        if (it->v == t) return true;
      }
    }
  }
  return false;
}
int dinic(int s, int t, int n) {
  int ret = 0;
  while (path(s, t, n)) {
    while (int aug = augment(s, t, INF)) {
      ret += aug;
    }
  }
  return ret;
}
}  // namespace maxflow
const int N = 50;
const int BOUND = 1e6;
const int LEN = 202;
int A[N], B[N], C[N];
int F(int x, int i) { return BOUND - (A[i] * x * x + B[i] * x + C[i]); }
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; ++i) {
    scanf("%d%d%d", &A[i], &B[i], &C[i]);
  }
  maxflow::last = maxflow::pool;
  fill(maxflow::a, maxflow::a + LEN * n + 2, nullptr);
  int s = LEN * n, t = s + 1;
  for (int i = 0; i < n; ++i) {
    int low, high;
    scanf("%d%d", &low, &high);
    low += 101;
    high += 101;
    maxflow::add_edge(s, i * LEN, INF);
    for (int j = 1; j < LEN; ++j) {
      int cost = (j >= low && j <= high ? F(j - 101, i) : INF);
      maxflow::add_edge(i * LEN + j - 1, i * LEN + j, cost);
    }
    maxflow::add_edge(i * LEN + LEN - 1, t, INF);
  }
  while (m--) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    --x;
    --y;
    for (int i = 0; i < LEN; ++i) {
      if (i - z >= 0 && i - z < LEN) {
        maxflow::add_edge(x * LEN + i, y * LEN + i - z, INF);
      }
    }
  }
  printf("%d\n", n * BOUND - maxflow::dinic(s, t, n * LEN + 2));
  return 0;
}
