#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <math.h>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
#include <tuple>
using namespace std;
using ll = long long;

int N, M;
ll L[101010];

int main() {

    cin >> N >> M;
    for(int i = 0; i < N; ++i) cin >> L[i];

    ll ans = 0;
    for(int i = 0; i < M; ++i) {
        int F; ll B, W; cin >> F >> B >> W;
        int n = lower_bound(L, L+N, F)-L;
        int c;
        if(n == N) c = F-L[N-1];
        else if(n == 0) c = L[0]-F;
        else c = min(L[n]-F, F-L[n-1]);

        ans += max(B, W-c);
    }

    cout << ans << endl;

}