#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstdlib>
#include<algorithm>
using namespace std;
long long n,k,shu,ans=2100000000,s[5000010],x,y,z,ss[5000010];
int main()
{
cin>>n>>k;
for(int i=1; i<=n; i++)scanf("%lld",&s[i]);
for(int i=1; i<=k; i++)
{
	scanf("%lld%lld%lld",&x,&y,&z);
	if(x>y)swap(x,y);
	s[x]+=z,s[y+1]-=z;
}
for(int i=1; i<=n; i++)shu+=s[i],ss[i]+=shu,ans=min(ans,ss[i]);
cout<<ans;
	return 0;
}