#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)

int main(){
	int n,m;
	cin>>n>>m;
	vector<int> l(n);
	rep(i,n) cin>>l.at(i);
	vector<int> f(m),b(m),w(m);
	rep(i,m) cin>>f.at(i)>>b.at(i)>>w.at(i);
	ll ans=0;
	rep(i,m){
		if(!binary_search(l.begin(),l.end(),f.at(i))){
			auto itr=lower_bound(l.begin(),l.end(),f.at(i));
			int tmp=1e9;
			if(itr!=l.end()) tmp=min(tmp,*itr-f.at(i));
			if(itr!=l.begin()){
				itr--;
				tmp=min(tmp,f.at(i)-*itr);
			}
			ans+=max(b.at(i),w.at(i)-tmp);
		}else{
			ans+=w.at(i);
		}
	}
	cout<<ans<<endl;
}