#include <bits/stdc++.h>
using namespace std;

int main(void) {
    int n,m;
    cin >> n >> m;
    vector<int> l(n);
    for(int i=0;i<n;++i){
        cin >> l[i];
    }
    vector<int> f(m);
    vector<int> b(m);
    vector<int> w(m);
    long long ans=0;
    for(int i=0;i<m;++i){
        cin >> f[i] >> b[i] >> w[i];
        int pos=lower_bound(l.begin(),l.end(),f[i])-l.begin();
        if(pos>0&&l[pos]-f[i]>f[i]-l[pos-1]){
            --pos;
        }
        if(pos==n){
            --pos;
        }
        ans+=max(b[i],w[i]-abs(l[pos]-f[i]));
    }
    cout << ans << endl;
    return 0;
}