#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define lll __int128
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>
#define pdd pair<double, double>

#define N 400010
#define K 550

int n, m, r;
ll d[N], k[N], c[N], cp[K];
ll dp[N];

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m >> r;
    for (int i = 0; i < n; ++ i) cin >> d[i] >> k[i] >> c[i];

    vector<int> rc;
    for (int i = 0; i < m; ++ i) {
        int p, q; cin >> p >> q;
        for (int j = 0; j < q; ++ j) {
            rc.emplace_back(p);
        }
    }
    sort(rc.begin(), rc.end());

    int sz = rc.size();
    for (int i = 0; i < sz; ++ i) dp[i] = LNF; 
    for (int i = 0; i < n; ++ i) cp[i] = sz-1;

    for (int i = sz-1; i >= 0; -- i) {        
        dp[i] = min(dp[i], dp[i+1] + r);
        for (int j = 0; j < n; ++ j) {
            dp[i] = min(dp[i], dp[cp[j]+1] + c[j]);
            
            if (i) {
                int x = i-1;
                while (cp[j] > x && (rc[cp[j]] >= rc[x] + d[j] || cp[j] - x >= k[j])) -- cp[j];
            }
        }
    }  

    cout << dp[0] << '\n';
}