#include<bits/stdc++.h>
using namespace std;
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define int long long
#define ull unsigned long long
#define fi first
#define se second
#define pi pair<int,int>

const int N=1e6+10;
const int INF=1e18;

struct node{
    int p,q;
};

map<int,int> mp;

void solve(){
    int n,m,r;
    cin>>n>>m>>r;
    mp.clear();
    vector<int> d(n+1),k(n+1),c(n+1);
    for(int i=1;i<=n;i++){
        cin>>d[i]>>k[i]>>c[i];
    }
    vector<node> a(m+1);
    int sq=0;
    for(int i=1;i<=m;i++){
        cin>>a[i].p>>a[i].q;
        sq+=a[i].q;
    }
    sort(a.begin(),a.end(),[&](node a,node b){ return a.p<b.p;});
    vector<int> day(sq+1);
    int last=0;
    for(int i=1;i<=m;i++){
        for(int j=last+1;j<=last+a[i].q;j++){
            day[j]=a[i].p;
        }
        last=last+a[i].q;
        mp[a[i].p]=last;
    }
    vector<int> f(sq+1,INF);
    vector<vector<int>> pre(sq+1,vector<int>(n+1));
    for(int i=1;i<=sq;i++){
        for(int j=1;j<=n;j++){
            pre[i][j]=mp[day[i]-d[j]];
        }
    }
    f[0]=0;
    for(int i=1;i<=sq;i++){
        f[i]=f[i-1]+r;
        for(int j=1;j<=n;j++){
            f[i]=min({f[i],f[max(i-k[j],pre[i][j])]+c[j]});
            // cout<<i<<" "<<day[i]<<" "<<d[j]<<" "<<mp[day[i]-d[j]]<<" "<<i-k[j]<<"\n";
        }
    }
    cout<<f[sq]<<"\n";
}

signed main(){
    int _=1;
    // cin>>_;
    while(_--){
        solve();
    }
}