#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <vector>
#include <cmath>
#include <set>
#define ll long long
using namespace std;

int main() {
    int n, m;
    cin >> n >> m; 

    vector<int> pohon(n);
    for (int i = 0; i < n; i++) cin >> pohon[i];

    vector< pair<int, int> > ikan(m);

    int score = 0;
    for (int i = 0; i < m; i++)
    {
        int f, b, w;
        cin >> f >> b >> w;

        int ansdist = 1e9 + 7;
        int l = 0, r = n-1;
        while (l <= r)
        {
            int mid = l + (r - l) / 2;

            int dist = pohon[mid] - f;

            if (abs(dist) <= ansdist)
                ansdist = abs(dist);
            
            if (dist == 0)
            {
                ansdist = 0;
                break;
            } else if (dist < 0)
            {
                l = mid + 1;
            } else if (dist > 0)
            {
                r = mid - 1;
            }
        }

        int profit = w - b;
        if (profit > ansdist)
        {
            score += (w - ansdist);
        } else score += b;
    }
    
    cout << score << endl;
    return 0;
}