#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll n,m;
  cin>>n>>m;
  vector<ll> L(n);
  rep(i,n) cin>>L[i];
  vector<ll> F(m),B(m),W(m);
  rep(i,m) cin>>F[i]>>B[i]>>W[i];
  
  ll ans=0;
  rep(i,m){
    auto t=lower_bound(ALL(L),F[i])-L.begin();
    ll mi=1e9+7;
    if(t!=n){
      if(L[t]==F[i]){
        ans+=W[i];
        continue;
      }
      ans+=B[i];
      mi=min(mi,L[t]-F[i]);
    }
    else ans+=B[i];
    if(t!=0){
      t--;
      mi=min(mi,F[i]-L[t]);
    }
    if(W[i]-B[i]>mi){
      ans+=W[i]-B[i]-mi;
    } 
  }
  cout<<ans<<endl;
    
  return 0;
}