#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(ch<'0'||ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while(ch>='0'&&ch<='9') { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); }
    return x*f;
}
const int N=1e5+7;
int n,m,v[N];
ll ans;
int main()
{
    n=read(),m=read(); int a,b,c;
    for(int i=1;i<=n;i++) v[i]=read()*2;
    for(int i=1;i<=m;i++)
    {
        a=read(),b=read(),c=read();
        v[a]+=c; v[b]+=c;
    }
    sort(v+1,v+n+1);
    for(int i=1;i<=n;i++)

        ans+=(i&1 ? -1 : 1)*v[i];
    printf("%lld


",ans/2);
    return 0;
}