#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int N = 509;
const int M = 3e5+9;
int n,m,r;
struct pp{int d,k,c;}a[N];
struct qq{int p,q;}b[M];
int e[M],cnt;
bool cmp(qq x,qq y){return x.p<y.p;}
int f[M],dnt[N];


signed main(){
    scanf("%lld%lld%lld",&n,&m,&r);
    for(int i=1;i<=n;i++) scanf("%lld%lld%lld",&a[i].d,&a[i].k,&a[i].c);
    for(int i=1;i<=m;i++) scanf("%lld%lld",&b[i].p,&b[i].q);
    sort(b+1,b+m+1,cmp);
    cnt=0;
    for(int i=1;i<=m;i++)
        for(int j=1;j<=b[i].q;j++) e[++cnt]=b[i].p;
    memset(f,0x3f,sizeof(f));
    f[0]=0;
    for(int i=1;i<=n;i++) dnt[i]=1;
    for(int i=0;i<cnt;i++){
        for(int j=1;j<=n;j++){
            while(dnt[j]<cnt&&e[dnt[j]+1]<=e[i+1]+a[j].d-1&&dnt[j]+1-i<=a[j].k) ++dnt[j];
            // printf("->%lld %lld\n",j,dnt[j]);
            f[dnt[j]]=min(f[dnt[j]],f[i]+a[j].c);
        }
        f[i+1]=min(f[i+1],f[i]+r);
        // printf("%lld %lld\n",i,f[i]);
    }
    printf("%lld\n",f[cnt]);
    return 0;
}