#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;

int main(){
    int N,M;
    cin>>N>>M;
    vector<ll> L(N);
    for(int i=0;i<N;i++) cin>>L[i];
    sort(L.begin(),L.end());
    vector<ll> F(M),B(M),W(M);
    vector<ll> d(M);
    ll cost=0;
    for(int i=0;i<M;i++){
        cin>>F[i]>>B[i]>>W[i];
        cost+=B[i];
        d[i]=W[i]-B[i];//水中だと+d[i]の強さ
    }

    for(int i=0;i<M;i++){
        auto it=upper_bound(L.begin(),L.end(),F[i]);
        ll dist=INF;
        if(it!=L.end()){
            dist=min(dist,*it-F[i]);
        }
        if(it!=L.begin()){
            it--;
            dist=min(dist,F[i]-*it);
        }
        if(d[i]-dist>=0){
            cost+=d[i]-dist;
        }
    }

    cout<<cost<<endl;

}