#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = (int)1e9 + 1001010;
constexpr ll llINF = (ll)4e18 + 22000020;
const string endn = "\n";
template <class T> inline vector<vector<T>> vector2(size_t i, size_t j, const T &init = T()) {return vector<vector<T>>(i, vector<T>(j, init));}
const string ELEM_SEPARATION = " ", VEC_SEPARATION = endn;
template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}
template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");} return o;}
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? VEC_SEPARATION : "");} return o;}
template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}
template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}
template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}
template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}
ll floor(ll a, ll b) {assert(b != 0); return((a%b != 0 && ((a>0) != (b>0))) ? a/b-1 : a/b);}
ll ceil (ll a, ll b) {assert(b != 0); return((a%b != 0 && ((a>0) == (b>0))) ? a/b+1 : a/b);}
// ================================== ここまでテンプレ ==================================

// absが使える型に限る
template<class T>
T nearest_value(const vector<T> &v, T key, bool prioritizeBig = true){
    assert(v.size() > 0);
    if(v.size() == 1) return *v.begin();

    auto lb = lower_bound(v.begin(), v.end(), key);
    if(lb == v.begin()) lb++;
    else if(lb == v.end()) lb--;
    T big = *lb;
    T small = *prev(lb);

    if(abs(big - key) < abs(small - key)) return big;
    else if(abs(big - key) > abs(small - key)) return small;
    else{
        if(prioritizeBig) return big;
        else return small;
    }
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m; cin >> n >> m;
    vector<ll> l(n); cin >> l;
    ll ans = 0;
    for(int i = 0; i < m; i++){
        ll f, b, w; cin >> f >> b >> w;
        ll cost = abs(nearest_value(l, f) - f);
        ans += max(b, w-cost);
    }

    cout << ans << endl;
    return 0;
}