using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var l = NList;
        var map = NArr(m);
        var ans = 0L;
        for (var i = 0; i < map.Length; ++i)
        {
            var pos = LowerBound(0, map[i][0], l);
            if (pos == l.Length) --pos;
            else if (pos > 0)
            {
                if (map[i][0] - l[pos - 1] < l[pos] - map[i][0]) --pos;
            }
            ans += Math.Max(map[i][1], map[i][2] - Math.Abs(map[i][0] - l[pos]));
        }
        WriteLine(ans);
    }
    static int LowerBound(int left, int min, int[] list)
    {
        if (list[left] >= min) return left;
        var ng = left;
        var ok = list.Length;
        while (ok - ng > 1)
        {
            var center = (ng + ok) / 2;
            if (list[center] < min) ng = center;
            else ok = center;
        }
        return ok;
    }
}