#include<cstdio>
#include<algorithm>
#define lg(x) (31-__builtin_clz(x))
#define llg(x) (63-__builtin_clzll(x))
#define int long long
const int N=300086,INF=1e18+7;
int n,m,r,tot,a[N],np[N],f[N];
int Max(int a,int b){return a>b?a:b;}
int Min(int a,int b){return a<b?a:b;}
struct cinf{int d,k,c,mn;}c[N];
struct infor{int p,q;}d[N];
struct STList{
	int sze,a[N][20];
	STList(){sze=0;}
	bool push(int x){
		a[++sze][0]=x;
		for(int i=1;(1<<i)<=sze;i++)
			a[sze][i]=Min(a[sze][i-1],a[sze-(1<<(i-1))][i-1]);
		return true;
	}
	int query(int l,int r){
		if(l>r)return INF;if(l<1)return 0;if(r>sze)r=sze;int lo=llg(r-l+1);
		return Min(a[r][lo],a[l+(1<<lo)-1][lo]);
	}
}rmq;
int read(){
	char ch=getchar();int nn=0,ssss=1;
	while(ch<'0'||ch>'9'){if(ch=='-')ssss*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){nn=nn*10+(ch-'0');ch=getchar();}
	return nn*ssss;
}
signed main(){
	n=read();m=read();r=read();
	for(int i=1;i<=n;i++){c[i].d=read();c[i].k=read();c[i].c=read();np[i]=1;}
	for(int i=1;i<=m;i++){d[i].p=read();d[i].q=read();}
	std::sort(d+1,d+m+1,[&](infor x,infor y){return x.p<y.p;});
	for(int i=1;i<=m;i++)
		for(int j=1;j<=d[i].q;j++)a[++tot]=d[i].p;
	for(int i=1;i<=tot;i++){
		f[i]=f[i-1]+r;
		for(int j=1;j<=n;j++){
			int pos=i-c[j].k+1;pos=Max(pos,1);
			while(a[np[j]]<a[i]-c[j].d+1)np[j]++;
			pos=Max(np[j],pos);
			f[i]=Min(f[i],rmq.query(pos-1,i-1)+c[j].c);
		}
		rmq.push(f[i]);
	}
	printf("%lld",f[tot]);
}