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

typedef long long ll;

int main(){
    ll n, m, r;
    cin >> n >> m >> r;

    vector<ll>d(n), k(n), c(n);
    for(ll i=0; i<n; i++)cin >> d[i] >> k[i] >> c[i];

    vector<ll>a;
    a.push_back(-1e10);
    for(ll i=0; i<m; i++){
        ll p, q;
        cin >> p >> q;
        while(q--)a.push_back(p);
    }

    ll cnt = a.size();
    vector<ll>dp(cnt,1e18);
    dp[0] = 0;

    vector<ll>last(n,0);
    for(ll i=1; i<cnt; i++){
        dp[i] = dp[i-1]+r;
        for(ll j=0; j<n; j++){
            while(i-last[j] > k[j] || a[i]-a[last[j]+1] >= d[j])last[j]++;
            dp[i] = min(dp[i], dp[last[j]]+c[j]);
        }

    }
    cout << dp.back();
}