#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <cassert>
using namespace std;

const int MAX_PASS = 10010, MAX_STAT = 1010, INF = 0x3f3f3f3f;
int TotStat, TotPass, TotAcc;
int OffPassPrefix[MAX_STAT];

struct Stat
{
	int InTime, OutTime;
	int OffPassCnt, LastPassTime;
	int PrevDist;
}_stats[MAX_STAT];

struct Pass
{
	Stat *S, *T;
	int Time;

	Pass(int s, int t, int time):S(_stats+s),T(_stats+t),Time(time){}

	Pass(){}
}_passes[MAX_PASS];

struct Range
{
	int OffPassCnt;
	int L, R;

	Range(int l, int r) :L(l), R(r), OffPassCnt(OffPassPrefix[r]-OffPassPrefix[l - 1]){}

	bool operator < (const Range& a) const
	{
		return OffPassCnt < a.OffPassCnt;
	}

	void GetAccableSubranges(void(*func) (Range))
	{
		int tl = L;
		for (int r = L; r <= R; r++)
		{
			if (_stats[tl].PrevDist == 0)
			{
				assert(tl == r);
				tl++;
			}
			else if (_stats[r].InTime <= _stats[r].LastPassTime)
			{
				func(Range(tl, r));
				tl = r + 1;
			}
		}
	}

	void Accelerate()//Accelerate at Left Prev.
	{
		for (int i = L; i <= R - 1; i++)
		{
			assert(_stats[i].InTime == _stats[i].OutTime);
			//assert(_stats[i].PrevDist);//Don‘t assert!
			_stats[i].InTime--;
			_stats[i].OutTime--;
		}
		_stats[R].InTime--;
		_stats[L].PrevDist--;
		TotAcc--;
	}
};

void Read()
{
	scanf("%d%d%d", &TotStat, &TotPass, &TotAcc);
	for (int i = 2; i <= TotStat; i++)
		scanf("%d", &_stats[i].PrevDist);
	for (int i = 1; i <= TotPass; i++)
	{
		int s, t, sTime;
		scanf("%d%d%d", &sTime, &s, &t);
		_passes[i] = Pass(s, t, sTime);
	}
}

void Init()
{
	for (int i = 1; i <= TotPass; i++)
	{
		_passes[i].S->OutTime = max(_passes[i].S->OutTime, _passes[i].Time);
		_passes[i].T->OffPassCnt++;
		_passes[i].S->LastPassTime = max(_passes[i].S->LastPassTime, _passes[i].Time);
	}
	for (int i = 2; i <= TotStat; i++)
	{
		_stats[i].InTime = _stats[i - 1].OutTime + _stats[i].PrevDist;
		_stats[i].OutTime = max(_stats[i].OutTime, _stats[i].InTime);
	}
	_stats[TotStat].LastPassTime = INF;
	for (int i = 1; i <= TotStat; i++)
		OffPassPrefix[i] = _stats[i].OffPassCnt + OffPassPrefix[i - 1];
}

priority_queue<Range> q;

void InQ(Range r)
{
	q.push(r);
}

void DoAcc()
{
	Range(1, TotStat).GetAccableSubranges(InQ);
	while (!q.empty() && TotAcc)
	{
		Range cur = q.top();
		q.pop();
		cur.Accelerate();
		cur.GetAccableSubranges(InQ);
	}
}

int GetAns()
{
	int ans = 0;
	for (int i = 1; i <= TotPass; i++)
		ans += _passes[i].T->InTime - _passes[i].Time;
	return ans;
}

int main()
{
	Read();
	Init();
	DoAcc();
	printf("%d\n", GetAns());
	return 0;
}