#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#define rep(i,n) for(int i=0;i<(n);i++)
#define for1(i,a,n) for(int i=(a);i<=(n);i++)
#define read(a) a=getnum()
#define print(a) printf("%d\n",a)
#define CC(i,a) memset(i,a,sizeof(i))
using namespace std;

const int maxn=5005,maxm=50005,INF=0x7fffffff;
int n,m,sumw;
int cost[maxn],level[maxn+maxm],iter[maxn+maxm];
struct edge { int to,cap,rev; };
vector <edge> g[maxn+maxm];

inline int getnum()
{
    int r=0,k=1; char c;
    for(c=getchar();c<‘0‘||c>‘9‘;c=getchar()) if(c==‘-‘) k=-1;
    for(;c>=‘0‘&&c<=‘9‘;c=getchar()) r=r*10+c-‘0‘;
    return r*k;
}

void add_edge(int from,int to,int cap)
{
    g[from].push_back((edge) { to,cap,g[to].size() });
    g[to].push_back((edge) { from,0,g[from].size()-1 });
}

void bfs(int s)
{
    CC(level,-1);
    level[s]=0;
    queue <int> q;
    q.push(s);
    while(!q.empty())
    {
        int t=q.front(); q.pop();
        rep(i,g[t].size())
        {
            edge e=g[t][i];
            if(level[e.to]<0&&e.cap>0)
            {
                level[e.to]=level[t]+1;
                q.push(e.to);
            }
        }
    }
}

int dfs(int v,int t,int f)
{
    if(v==t) return f;
    for(int &i=iter[v];i<g[v].size();i++)
    {
        edge &e=g[v][i];
        if(e.cap>0&&level[e.to]>level[v])
        {
            int d=dfs(e.to,t,min(f,e.cap));
            if(d>0)
            {
                e.cap-=d;
                g[e.to][e.rev].cap+=d;
                return d;
            }
        }
    }
    return 0;
}
    
int max_flow(int s,int t)
{
    int flow=0;
    bfs(s);
    while(level[t]>0)
    {
        CC(iter,0);
        int f;
        while((f=dfs(s,t,INF))>0) flow+=f;
        bfs(s);
    }
    return flow;
}

void init()
{
    read(n); read(m);
    for1(i,1,n)
    {
        read(cost[i]);
        add_edge(i,n+m+1,cost[i]);
    }
    for1(i,1,m)
    {
        int a,b,c;
        read(a); read(b); read(c);
        add_edge(0,n+i,c);
        add_edge(n+i,a,INF);
        add_edge(n+i,b,INF);
        sumw+=c;
    }
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("prof.in","r",stdin);
    freopen("prof.out","w",stdout);
#endif
    init();
    print(sumw-max_flow(0,n+m+1));
    
#ifndef ONLINE_JUDGE
    fclose(stdin);
    fclose(stdout);
    system("prof.out");
#endif
    return 0;
}