#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#define maxn 100100

using namespace std;

double a[maxn];

int n,m,u,v;

double w,s1,s0;

int main()

{

    while (scanf("%d%d",&n,&m)!=EOF)

    {

        for (int i=; i<=n; i++) scanf("%lf",&a[i]);

        while (m--)

        {

            scanf("%d%d%lf",&u,&v,&w);

            w/=;

            a[u]+=w,a[v]+=w;

        }

        sort(a+,a++n);

        s1=s0=; m=;

        for (int i=n; i>; i--)

        {

            if (m&) s0+=a[i];

                else s1+=a[i];

            m++;

        }

        printf("%.0f\n",s0-s1);

    }

    return ;

}