#include<bits/stdc++.h>
using namespace std;

const int maxn=1610;
const int maxm=7e5+10;
const int maxxn=0x3f3f3f3f;

inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}


int n,m;
int a[805];
int S,T,SS,TT;
int cost[805][805];
int W[maxn];
struct Graph{
    struct edge{
        int to,nxt;
        int lim,c;
    }e[maxm<<1];
    int head[maxn],cnt=1;
    inline void add_edge(int u,int v,int w,int c){
        // printf("%d %d %d %d\n",u,v,w,c);
        e[++cnt].to=v,e[cnt].nxt=head[u],e[cnt].lim=w,e[cnt].c=c,head[u]=cnt;
        e[++cnt].to=u,e[cnt].nxt=head[v],e[cnt].lim=0,e[cnt].c=-c,head[v]=cnt;
    }
    int pre[maxn];
    int dis[maxn];
    bool vis[maxn];
    inline void SPFA(int s){
        queue<int> q;
        memset(dis,0x3f,sizeof(dis));
        memset(vis,0,sizeof(vis));
        dis[s]=0,vis[s]=1;
        q.push(s);
        while(!q.empty()){
            int u=q.front();
            vis[u]=0;
            q.pop();
            for(int i=head[u];i;i=e[i].nxt){
                int v=e[i].to,c=e[i].c;
                if(dis[u]+c<dis[v]&&e[i].lim){
                    pre[v]=i;
                    dis[v]=dis[u]+c;
                    if(vis[v]) continue;
                    vis[v]=1;
                    q.push(v);
                }
            }
        }
    }
    inline int min_cost_max_flow(int s,int t){
        int max_flow=0,min_cost=0;
        while(1){
            SPFA(s);
            if(dis[t]==maxxn) return min_cost;
            int mn=maxxn;
            for(int u=t;u!=s;u=e[pre[u]^1].to) mn=min(mn,e[pre[u]].lim);
            max_flow+=mn;
            for(int u=t;u!=s;u=e[pre[u]^1].to){
                min_cost+=mn*e[pre[u]].c;
                e[pre[u]].lim-=mn,e[pre[u]^1].lim+=mn;
            }
        }
    }
}G;
int ans;
int main(){
    // freopen("test.in","r",stdin);
    // freopen("test.out","w",stdout);
    n=read(),m=read();
    S=n*2+1,T=n*2+2,SS=n*2+3,TT=n*2+4;
    for(int i=1;i<=n;++i){
        a[i]=read();
        G.add_edge(S,i,1,a[i]);
        G.add_edge(i,i+n,0,0);
        ++W[i],--W[i+n];
        G.add_edge(i+n,T,1,0);
    }
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j){
            cost[i][j]=a[j];
        }
        cost[i][i]=0;
    }
    for(int i=1;i<=m;++i){
        int u=read(),v=read(),w=read();
        if(u>v) swap(u,v);
        cost[u][v]=min(cost[u][v],w);
    }
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j){
            if(i==j) continue;
            G.add_edge(i+n,j,1,cost[i][j]);
        }
    }
    for(int i=1;i<=T;++i){
        if(W[i]>0) G.add_edge(i,TT,W[i],0);
        if(W[i]<0) G.add_edge(SS,i,-W[i],0);
    }
    G.add_edge(T,S,1e9,0);
    printf("%d\n",G.min_cost_max_flow(SS,TT));
    return 0;
}