#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	long long ans = 0;
	vector<int>l(n);
	rep(i, n)cin >> l[i];
	l.push_back(INF * 2);
	l.push_back(-INF * 2);
	sort(all(l));
	rep(i, m) {
		long long f, b, w; cin >> f >> b >> w;
		if (upper_bound(all(l), f) - lower_bound(all(l), f)) {
			ans += w;
			continue;
		}
		int cnt = upper_bound(all(l), f) - l.begin();
		long long val = b;
		chmax(val, w - abs(f - l[cnt - 1]));
		chmax(val, w - abs(f - l[cnt + 0]));
		ans += val;
	}
	cout << ans << endl;
	return 0;
}