#include <bits/stdc++.h>
using namespace std;
struct edge {
  long long a, b;
  long long cap, flow;
  edge(long long az, long long bz, long long capz, long long flowz) {
    a = az;
    b = bz;
    cap = capz;
    flow = flowz;
  }
};
vector<edge> ed;
vector<long long> g[(long long)3e5];
long long d[(long long)3e5];
long long pos[(long long)3e5];
void add(long long a, long long b, long long c) {
  g[a].push_back(ed.size());
  ed.push_back(edge(a, b, c, 0));
  g[b].push_back(ed.size());
  ed.push_back(edge(b, a, 0, 0));
}
long long INF = 1e18;
long long M = 1e12;
bool bfs(long long s, long long t, long long B) {
  queue<long long> q;
  for (long long i = s; i <= t; i++) d[i] = INF;
  d[s] = 0;
  q.push(s);
  while (!q.empty()) {
    long long v = q.front();
    q.pop();
    for (auto x : g[v]) {
      if (d[v] + 1 < d[ed[x].b] && ed[x].cap - ed[x].flow >= B) {
        d[ed[x].b] = d[v] + 1;
        q.push(ed[x].b);
      }
    }
  }
  return (d[t] < INF);
}
long long ans = 0;
long long cnt = 0;
long long dfs(long long v, long long t, long long cmin, long long B) {
  if (v == t) {
    ans += cmin;
    return cmin;
  }
  for (; pos[v] < (long long)g[v].size(); pos[v]++) {
    long long x = g[v][pos[v]];
    if (d[ed[x].a] + 1 == d[ed[x].b] && ed[x].cap - ed[x].flow >= B) {
      long long d = dfs(ed[x].b, t, min(cmin, ed[x].cap - ed[x].flow), B);
      if (d > 0) {
        ed[x].flow += d;
        ed[x ^ 1].flow -= d;
        return d;
      }
    }
  }
  return 0;
}
long long S, T;
const long long sz = 210;
long long a[100];
long long b[100];
long long c[100];
long long l[100];
long long r[100];
int main() {
  long long n, m;
  cin >> n >> m;
  S = 0;
  T = (n + 1) * sz;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i] >> b[i] >> c[i];
  }
  for (long long i = 1; i <= n; i++) {
    cin >> l[i] >> r[i];
    add(S, l[i] + i * sz - 1, INF);
    for (long long j = l[i] + i * sz; j <= r[i] + i * sz; j++) {
      add(j - 1, j,
          M - a[i] * (j - i * sz) * (j - i * sz) - b[i] * (j - i * sz) - c[i]);
    }
    add(r[i] + i * sz, T, INF);
  }
  for (long long i = 1; i <= m; i++) {
    long long u, v, e;
    cin >> u >> v >> e;
    for (long long j = l[v] - 1; j <= r[v]; j++) {
      if (j + e <= r[u] && j + e >= l[u] - 1)
        add(u * sz + j + e, v * sz + j, INF);
    }
  }
  for (long long i = 30; i >= 0; i--) {
    long long B = (1ll << i);
    while (bfs(S, T, B)) {
      for (long long j = 0; j <= T; j++) pos[j] = 0;
      while (dfs(S, T, INF, B)) {
      }
    }
  }
  cout << M * n - ans << endl;
}
