//B;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    ll n, m; cin>>n>>m;
    vector<ll> L;
    vector<pair<ll, pair<ll, ll>>> F(m+1);

    L.push_back(LLONG_MIN);
    for(ll i = 1; i<=n; i++) {
        ll x; cin>>x;
        L.push_back(x);
    }
    L.push_back(LLONG_MAX);

    for(ll i = 1; i<=m; i++) {
        ll Fi, B, W; cin>>Fi>>B>>W;
        F[i] = {Fi, {B, W}};
    }

    ll ans = 0;
    for(ll i = 1; i<=m; i++) {
        //find L[i] yang lebih dekat ke Fi
        //Binary search
        //lower bound -> nilai pertama yg >=value
        //upper bound -> nilai pertama yg >value
        ll Fi = F[i].first;
        ll B = F[i].second.first;
        ll W = F[i].second.second;
        
        ll idx = lower_bound(L.begin(), L.end(), Fi)-L.begin();
     

        ll c1 = L[idx];
        ll c2 = L[idx-1];
 

        ll pohonTerdekat = 
        (abs(c1-Fi) < abs(c2-Fi) ? c1 : c2);

        ll move = W - abs(pohonTerdekat - Fi);

        ll stay = (binary_search(L.begin(), L.end(), Fi) ? W:B); 
        //tetap, tidak pindah
        //jika posisinya sdh tertutup pohon maka W
        //jika blm maka B

        ans += max(move, stay);
    }

    cout<<ans<<"\n";



}