#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<map>
#include<vector>
#include<set> 
#define inf 0x7fffffff
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
using namespace std;
int cost[2000],d[2000],mx[2000],sum[2000],g[2000],n,m,k,ans;
struct node{int l,r,t;}e[100100];
int main()
{
	freopen("bus.in","r",stdin);
	freopen("bus.out","w",stdout); 
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<n;i++)scanf("%d",&d[i]);
	for(int i=1;i<=m;i++)
	scanf("%d%d%d",&e[i].t,&e[i].l,&e[i].r),mx[e[i].l]=max(mx[e[i].l],e[i].t),sum[e[i].r]++;
	for(int i=1;i<=n;i++)sum[i]+=sum[i-1];cost[1]=0;
	for(int i=2;i<=n;i++)cost[i]=max(cost[i-1],mx[i-1])+d[i-1];
	for(int i=1;i<=m;i++)ans+=cost[e[i].r]-e[i].t;
	while(k)
	{
		g[n]=g[n-1]=n;
		for(int i=n-2;i;i--)
		if(cost[i+1]<=mx[i+1])g[i]=i+1;
		else g[i]=g[i+1];
		int mn=0,j=0;
		for(int i=1;i<=n;i++)
		 if(mn<sum[g[i]]-sum[i]&&d[i]>0)
		  mn=sum[g[i]]-sum[i],j=i;
		if(mn==0)break;
		ans-=mn;
		d[j]--;
		k--;
		cost[1]=0;
	    for(int i=2;i<=n;i++)cost[i]=max(cost[i-1],mx[i-1])+d[i-1];
	}printf("%d\n",ans);
}