/*
* Problem : starrace
* Contest : SDOI2010
* Author  : Yeefan Zhu
*/
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <queue>
using namespace std;
const int INF=1000000000;
const int MAXN=1605;
int N,M,S,T,P;
typedef int Array[MAXN];
Array pnt,flag,dist;
Array F[MAXN],Map[MAXN],Cost[MAXN];
vector<int> Mat[MAXN];
 
inline void AddEdge(int s,int e,int f,int c)
{
    Mat[s].push_back(e);
    Mat[e].push_back(s);
    Map[s][e]=f,Cost[s][e]=c;
    Map[e][s]=0,Cost[e][s]=-c;
}
 
void init()
{
    scanf("%d %d\n",&N,&M);
    S=N*2+1,T=S+1;
    P=T;
    for(int i=1;i<=P;i++)
        for(int j=1;j<=P;j++)
            F[i][j]=0,Map[i][j]=0,Cost[i][j]=0;
    int x;
    for(int i=1;i<=N;i++)
    {
        scanf("%d",&x);
        AddEdge(S,N+i,1,x);
        AddEdge(S,i,1,0);
        AddEdge(N+i,T,1,0);
    }
    int a,b,t;
    for(int i=1;i<=M;i++)
    {
        scanf("%d %d %d\n",&a,&b,&x);
        if(a>b) {t=b;b=a;a=t;}
        AddEdge(a,b+N,1,x);
    }
}
 
queue<int> Q;
void SPFA()
{
    for(int i=1;i<=P;i++)
        flag[i]=0,dist[i]=INF,pnt[i]=0;
    Q.push(S);
    flag[S]=1,dist[S]=0;
    int tmp,nxt;
    while(!Q.empty())
    {
        tmp=Q.front();
        Q.pop();
        flag[tmp]=0;
        for(unsigned int i=0;i<Mat[tmp].size();i++)
        {
            nxt=Mat[tmp][i];
            if(Map[tmp][nxt]>F[tmp][nxt] && dist[nxt]>dist[tmp]+Cost[tmp][nxt])
            {
                dist[nxt]=dist[tmp]+Cost[tmp][nxt];
                pnt[nxt]=tmp;
                if(flag[nxt]) continue;
                Q.push(nxt);
                flag[nxt]=1;
            }
        }
    }
}
 
inline int Min(int a,int b) {return a<b?a:b;}
 
void MCMF()
{
    int Ans=0;
    int MinFlow;
    int p;
    while(1+1==2)
    {
        SPFA();
        if(!pnt[T]) break;
        MinFlow=INF;
        p=T;
        while(pnt[p])
        {
            MinFlow=Min(MinFlow,Map[pnt[p]][p]-F[pnt[p]][p]);
            p=pnt[p];
        }
        Ans+=MinFlow*dist[T];
        p=T;
        while(pnt[p])
        {
            F[pnt[p]][p]+=MinFlow;
            F[p][pnt[p]]=-F[pnt[p]][p];
            p=pnt[p];
        }
    }
    printf("%d\n",Ans);
}
 
int main()
{
    freopen("YZ.in","r",stdin);
    freopen("YZ.out","w",stdout);
    init();
    MCMF();
    return 0;
}