#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
	int N, M;
	cin >> N >> M;
	ll ans = 0;
	set<ll> st1; set<ll, greater<ll>> st2;
	for (int i = 0; i < N; i ++) {
		ll L;
		cin >> L;
		st1.insert(L); st2.insert(L);
	}
	st1.insert((ll)1e14);
	st2.insert(-(ll)1e14);
	for (int i = 0; i < M; i ++) {
		ll f, b, w;
		cin >> f >> b >> w;
		ans += b;
		ll df = w - b;
		df -= min(abs(f - *st1.lower_bound(f)), abs(f - *st2.lower_bound(f)));
		ans += max(0ll, df);
	}
	cout << ans << endl;
}