#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#define fi first
#define se second
const int MOD = 1e9+7;
#define pin pair<int,int>
#define lup(i,x) for(int i=0; i<x; i++)
#define pb push_back
#define pu push
#define vint vector<int>
#define nitro ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define din(x) int x;cin>>x;
#define endl '\n'
#define cout std::cout
const int maxn = 1e9+5;
bool ar[maxn];
int po[100005];


void solve(){
     int n, m;
     cin >> n >> m;
     
     for(int i = 0; i < n; i++){
          int a; cin >> a;
          po[i] = a;
          ar[a] = true;

     }
     // for(int i=0; i<n; i++){
     //      cout << po[i] <<" " << ar[po[i]] << endl;
     // }
     // cout  << 123 << endl;
     int sum = 0;
     for(int i = 0; i < m; i++ ){
          int f, b, w;
          cin >> f >> b >> w;
          if(ar[f]==true){
               sum += w;
          }else{
               int ma = 1e11;
               for(int j = 0; j < n; j++){
                    // cout << 123 << endl;
                    ma = min(ma,abs(po[j]-f));
               }
               if(ma==1e11){
                    sum+=b;
               }else{
                    if(b < w-ma){
                         sum += w-ma;
                    }else{
                         sum += b;
                    }
               }
          }
     }
     cout << sum << endl;
}

signed main(){
     nitro
     // int n;
     // cin >> n;
     // while(n--){
          solve();
     // }
}