#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const long long INF = 1e9;
const long long LINF = 1e18;
namespace MaxFlow {
const int MAX = 1 << 20;
struct edge {
  int from;
  int to;
  long long cap;
  long long flow;
};
int n;
int source;
int sink;
int d[MAX];
int ptr[MAX];
vector<edge> e;
vector<int> g[MAX];
void add(int u, int v, long long w) {
  g[u].push_back((int)((e).size()));
  e.push_back({u, v, w, 0});
  g[v].push_back((int)((e).size()));
  e.push_back({v, u, 0, 0});
}
bool bfs() {
  queue<int> q;
  q.push(source);
  for (int i = (0); i < (n); ++i) d[i] = -1;
  d[source] = 0;
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (auto i : g[v]) {
      int to = e[i].to;
      if (d[to] != -1) continue;
      if (e[i].flow == e[i].cap) continue;
      q.push(to);
      d[to] = d[v] + 1;
    }
  }
  return d[sink] != -1;
}
long long dfs(int v, long long flow) {
  if (!flow) return 0;
  if (v == sink) return flow;
  while (1) {
    if (ptr[v] == (int)((g[v]).size())) break;
    int id = g[v][ptr[v]];
    int to = e[id].to;
    if (d[to] != d[v] + 1) {
      ++ptr[v];
      continue;
    }
    long long push = dfs(to, min(flow, e[id].cap - e[id].flow));
    if (push == 0) {
      ++ptr[v];
      continue;
    }
    e[id].flow += push;
    e[id ^ 1].flow -= push;
    return push;
  }
  return 0;
}
long long dinic() {
  cerr << "Don't forget about constant: " << MAX << endl;
  cerr << "Check n: " << n << endl;
  long long flow = 0;
  while (1) {
    if (!bfs()) break;
    for (int i = (0); i < (n); ++i) ptr[i] = 0;
    while (long long push = dfs(source, LINF)) flow += push;
  }
  return flow;
}
};  // namespace MaxFlow
const int MAX = 100;
int n, m;
int a[MAX], b[MAX], c[MAX], l[MAX], r[MAX];
int node(int i, int pos) { return 205 * (i + 1) + pos - (l[i] - 1); }
int F(int i, int j) { return a[i] * j * j + b[i] * j + c[i]; }
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (int i = (0); i < (n); ++i) cin >> a[i] >> b[i] >> c[i];
  for (int i = (0); i < (n); ++i) cin >> l[i] >> r[i];
  MaxFlow::source = 0;
  MaxFlow::sink = 50 * 210;
  MaxFlow::n = 50 * 210 + 1;
  for (int i = (0); i < (n); ++i) {
    MaxFlow::add(MaxFlow::source, node(i, l[i] - 1), LINF);
    MaxFlow::add(node(i, r[i]), MaxFlow::sink, LINF);
    for (int j = (l[i] - 1); j < (r[i]); ++j)
      MaxFlow::add(node(i, j), node(i, j + 1), INF - F(i, j + 1));
  }
  int u, v, w;
  for (int i = (0); i < (m); ++i) {
    cin >> u >> v >> w;
    --u;
    --v;
    for (int j = (l[u] - 1); j < (r[u] + 1); ++j) {
      int x = j - w;
      if (l[v] - 1 <= x && r[v] >= x)
        MaxFlow::add(node(u, j), node(v, x), LINF);
    }
  }
  long long Flow = MaxFlow::dinic();
  long long ans = n * INF;
  ans -= Flow;
  cout << ans << endl;
  cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
  return 0;
}
