#include <bits/stdc++.h>
using namespace std;
const long long maxn = 2e6 + 6;
const long long MOD = 1e9 + 7;
bool comparator(long long i, long long j) { return (i < j); }
long long power(long long x, long long i) {
  long long ans = 1;
  while (i > 0) {
    if (i & 1) ans = (ans * x) % MOD;
    i >>= 1;
    x = (x * x) % MOD;
  }
  return ans;
}
long long power(long long x, long long i, long long mod) {
  long long ans = 1;
  while (i > 0) {
    if (i & 1) ans = (ans * x) % mod;
    i >>= 1;
    x = (x * x) % mod;
  }
  return ans;
}
long long modInverse(long long x, long long mod) {
  return power(x, mod - 2, mod);
}
bool isPalindrome(string s) {
  long long limit = s.length() / 2;
  for (long long i = 0; i < limit; i++) {
    if (s[i] != s[s.length() - i - 1]) return 0;
  }
  return true;
}
long long gcd(long long x, long long y) {
  long long t;
  while (y != 0) {
    t = x % y;
    x = y;
    y = t;
  }
  return x;
}
bool isVowel(char ch) {
  if (ch == 'a' || ch == 'i' || ch == 'e' || ch == 'u' || ch == 'o' ||
      ch == 'y') {
    return true;
  }
  return false;
}
bool isPrime(long long n) {
  long long root = sqrt(n);
  for (long long i = 2; i <= root; i++)
    if (n % i == 0) return 0;
  return 1;
}
long double getDis(long double asdfg, long double qwert, long double gfdsa,
                   long double trewq) {
  return sqrt((asdfg - gfdsa) * (asdfg - gfdsa) +
              (qwert - trewq) * (qwert - trewq));
}
long double getDisSquare(long double asdfg, long double qwert,
                         long double gfdsa, long double trewq) {
  return (asdfg - gfdsa) * (asdfg - gfdsa) + (qwert - trewq) * (qwert - trewq);
}
bool isSquareHelper(long long asdfg, long long qwert, long long gfdsa,
                    long long trewq, long long x3, long long y3, long long x4,
                    long long y4) {
  long double d1, d2, d3, d4, d5, d6;
  d1 = getDisSquare(asdfg, qwert, gfdsa, trewq);
  d2 = getDisSquare(gfdsa, trewq, x3, y3);
  d3 = getDisSquare(x3, y3, x4, y4);
  d4 = getDisSquare(x4, y4, asdfg, qwert);
  if (d1 == d2 && d1 == d3 && d1 == d4) {
    d5 = getDisSquare(asdfg, qwert, x3, y3);
    d6 = getDisSquare(gfdsa, trewq, x4, y4);
    if (d5 == d6) {
      return 1;
    }
  }
  return 0;
}
bool isSquare(long long asdfg, long long qwert, long long gfdsa,
              long long trewq, long long x3, long long y3, long long x4,
              long long y4) {
  if (isSquareHelper(asdfg, qwert, gfdsa, trewq, x3, y3, x4, y4) ||
      isSquareHelper(asdfg, qwert, gfdsa, trewq, x4, y4, x3, y3) ||
      isSquareHelper(asdfg, qwert, x3, y3, gfdsa, trewq, x4, y4))
    return 1;
  else
    return 0;
}
bool isEqualateralTriangle(long long asdfg, long long qwert, long long gfdsa,
                           long long trewq, long long x3, long long y3) {
  long long d1 = getDisSquare(asdfg, qwert, gfdsa, trewq);
  long long d2 = getDisSquare(gfdsa, trewq, x3, y3);
  long long d3 = getDisSquare(x3, y3, asdfg, qwert);
  if (d1 == d2 && d1 == d3) {
    return 1;
  } else
    return 0;
}
bool isRightAngleTriangleHelper(long long asdfg, long long qwert,
                                long long gfdsa, long long trewq, long long x3,
                                long long y3) {
  long long d1 = getDisSquare(asdfg, qwert, gfdsa, trewq);
  long long d2 = getDisSquare(gfdsa, trewq, x3, y3);
  long long d3 = getDisSquare(x3, y3, asdfg, qwert);
  if (d2 == (d1 + d3)) {
    return 1;
  }
  return 0;
}
bool isRightAngleTriangle(long long asdfg, long long qwert, long long gfdsa,
                          long long trewq, long long x3, long long y3) {
  if (isRightAngleTriangleHelper(asdfg, qwert, gfdsa, trewq, x3, y3) ||
      isRightAngleTriangleHelper(gfdsa, trewq, x3, y3, asdfg, qwert) ||
      isRightAngleTriangleHelper(x3, y3, asdfg, qwert, gfdsa, trewq))
    return 1;
  return 0;
}
bool areCollinear(long long asdfg, long long qwert, long long gfdsa,
                  long long trewq, long long x3, long long y3) {}
long long n, m;
long long bounty, increase, capacity;
long long maxHealth[maxn], startHealth[maxn], heal[maxn], totDeaths = 0;
bool doesDie[maxn];
long long gotStrongerTime[maxn];
set<pair<long long, pair<long long, long long> > > s;
set<pair<long long, pair<long long, long long> > >::iterator itr, itr1, itr2;
void getInput() {
  long long x, y, z;
  cin >> n >> m;
  cin >> bounty >> increase >> capacity;
  for (long long i = 0; i < n; i++)
    cin >> maxHealth[i] >> startHealth[i] >> heal[i];
  for (long long i = 0; i < m; i++) {
    cin >> x >> y >> z;
    s.insert(make_pair(x, make_pair(y - 1, z)));
  }
  memset(doesDie, 0, sizeof doesDie);
  long long criticalTime = 0;
  for (long long i = 0; i < n; i++) {
    if (heal[i] != 0) {
      if (startHealth[i] <= capacity) {
        if (maxHealth[i] > capacity) {
          totDeaths++;
          doesDie[i] = 1;
          criticalTime = (capacity - startHealth[i]) / heal[i] + 1;
          gotStrongerTime[i] = criticalTime;
          s.insert(make_pair(criticalTime, make_pair(-1, i)));
        } else {
          totDeaths++;
          doesDie[i] = 1;
          gotStrongerTime[i] = 99999999999;
        }
      }
    } else {
      if (startHealth[i] <= capacity) {
        totDeaths++;
        doesDie[i] = 1;
        gotStrongerTime[i] = 99999999999;
      }
    }
  }
}
void solve() {
  long long ans = totDeaths * bounty;
  itr = s.begin();
  while (itr != s.end()) {
    long long curTime = itr->first;
    long long temp = 0;
    while (itr != s.end() && itr->first == curTime) {
      if (itr->second.first == -1) {
        long long enemyNum = itr->second.second;
        doesDie[enemyNum] = 0;
        temp--;
        itr2 = itr, itr2++, s.erase(itr), itr = itr2;
      } else {
        long long enemyNum = itr->second.first;
        long long newHealth = itr->second.second;
        if (newHealth <= capacity) {
          if (doesDie[enemyNum]) {
            if (maxHealth[enemyNum] > capacity) {
              s.erase(s.find(make_pair(gotStrongerTime[enemyNum],
                                       make_pair(-1, enemyNum))));
              if (heal[enemyNum] != 0) {
                long long criticalTime =
                    (capacity - newHealth) / heal[enemyNum] + 1 + curTime;
                gotStrongerTime[enemyNum] = criticalTime;
                s.insert(make_pair(criticalTime, make_pair(-1, enemyNum)));
                itr2 = itr, itr2++, s.erase(itr), itr = itr2;
              } else {
                gotStrongerTime[enemyNum] = 99999999999;
                itr2 = itr, itr2++, s.erase(itr), itr = itr2;
              }
            } else {
              gotStrongerTime[enemyNum] = 99999999999;
              itr2 = itr, itr2++, s.erase(itr), itr = itr2;
            }
          } else {
            if (heal[enemyNum] != 0) {
              long long criticalTime =
                  (capacity - newHealth) / heal[enemyNum] + 1 + curTime;
              doesDie[enemyNum] = 1;
              gotStrongerTime[enemyNum] = criticalTime;
              s.insert(make_pair(criticalTime, make_pair(-1, enemyNum)));
              itr2 = itr, itr2++, s.erase(itr), itr = itr2;
              temp++;
            } else {
              doesDie[enemyNum] = 1;
              gotStrongerTime[enemyNum] = 99999999999;
              itr2 = itr, itr2++, s.erase(itr), itr = itr2;
              temp++;
            }
          }
        } else {
          if (doesDie[enemyNum]) {
            s.erase(s.find(
                make_pair(gotStrongerTime[enemyNum], make_pair(-1, enemyNum))));
            doesDie[enemyNum] = 0;
            itr2 = itr, itr2++, s.erase(itr), itr = itr2;
            temp--;
          } else {
            long long doNothing = 1;
            itr2 = itr, itr2++, s.erase(itr), itr = itr2;
          }
        }
      }
    }
    if (temp < 0) {
      long long newTotalBounty =
          (bounty + (curTime - 1) * increase) * totDeaths;
      ans = max(ans, newTotalBounty);
    }
    totDeaths += temp;
    long long newTotalBounty = (bounty + curTime * increase) * totDeaths;
    ans = max(ans, newTotalBounty);
  }
  if (totDeaths > 0 && increase > 0) {
    cout << "-1"
         << "\n";
    return;
  }
  cout << ans << "\n";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) getInput(), solve();
  return 0;
}
