#include <bits/stdc++.h>
using namespace std; 
#define ld long double
#define fi first 
#define se second
#define int long long
#define pb push_back
const int mod = 1e9 + 7; 
vector<int>vis; 
int binser(int low, int high, int val){
    int l = low, r = high, ret = -1; 
    while(l <= r){
        int mid = (l+r)/2;
        if(vis[mid] <= val){
            ret = mid; l = mid + 1; 
        }
        else{
            r = mid - 1; 
        }
    }
    if(ret == -1)return ret; 
    else return val - vis[ret]; 
}
int binser2(int low, int high, int val){
    int l = low, r = high, ret = -1; 
    while(l <= r){
        int mid = (l+r)/2;
        if(vis[mid] >= val){
            ret = mid; r = mid - 1; 
        }
        else{
            l = mid + 1; 
        }
    }
    if(ret == -1)return ret; 
    else return vis[ret] - val; 
}
signed main(){
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL); 
    int n, m; cin >> n >> m; 
    
    for(int i = 1; i <= n; i++){
        int x; cin >> x; 
        vis.push_back(x);  
    }
    int ans = 0; 
    for(int i = 1; i <= m; i++){
        int f,b,w; cin >> f >> b >> w; 
        int tmp = binser(0,vis.size()-1,f), tmp2 = binser2(0,vis.size() - 1,f);
        //cout << "here >> " << tmp << " " << tmp2 << endl; 
        int val = -1; 
        if(tmp != -1){
            val = tmp; 
            if(tmp2 != -1)val = min(val,tmp2);
        }
        else if(tmp2 != -1)val = tmp2; 
        //cout << "here >> " << val << endl; 
        if(val == -1 || w - val <= b){
            ans += b; 
        }
        else{
            ans += (w - val); 
        }
    }
    cout << ans; 
}