1 #include<cstdio>
  2 #include<iostream>
  3 #include<algorithm>
  4 #include<cstring>
  5 #include<cmath>
  6 #include<queue>
  7 #define maxn 10065
  8 #define inf 0x7fffffff
  9
 10 using namespace std;
 11
 12 int head[maxn],dis[maxn],a[maxn],cnt=1,from[maxn],n,m,inq[maxn],ans,T;
 13
 14 struct ss
 15    {
 16        int to;
 17        int next;
 18        int from;
 19        int v;
 20        int c;
 21    }e[3000005];
 22
 23 void add(int u,int v,int w,int c)
 24    {
 25        e[++cnt].next=head[u];
 26        head[u]=cnt;
 27        e[cnt].c=c;
 28        e[cnt].v=w;
 29        e[cnt].from=u;
 30        e[cnt].to=v;
 31    }
 32
 33 void insert(int u,int v,int w,int c)
 34    {
 35        add(u,v,w,c);
 36        add(v,u,0,-c);
 37    }
 38
 39 bool spfa()
 40    {
 41         for (int i=0;i<=T;i++) dis[i]=inf;
 42         queue<int>que;
 43         que.push(0);
 44         inq[0]=1;
 45         dis[0]=0;
 46         while (!que.empty())
 47             {
 48                 int now=que.front();
 49                 que.pop();
 50                 for (int i=head[now];i;i=e[i].next)
 51                    if (e[i].v&&dis[e[i].to]>dis[now]+e[i].c)
 52                        {
 53                               dis[e[i].to]=dis[now]+e[i].c;
 54                               from[e[i].to]=i;
 55                               if (!inq[e[i].to])
 56                                   inq[e[i].to]=1,que.push(e[i].to);
 57                        }
 58                 inq[now]=0;
 59             }
 60         if (dis[T]!=inf) return 1;
 61          else return 0;
 62    }
 63
 64 void mcf()
 65    {
 66         int x=inf;
 67         for (int i=from[T];i;i=from[e[i].from])
 68                x=min(x,e[i].v);
 69         for (int i=from[T];i;i=from[e[i].from])
 70             {
 71                 e[i].v-=x;
 72                 e[i^1].v+=x;
 73                 ans+=e[i].c*x;
 74             }
 75    }
 76
 77 int main()
 78    {
 79         scanf("%d%d",&n,&m);
 80         T=2*n+1;
 81         for (int i=1;i<=n;i++) scanf("%d",&a[i]);
 82         for (int i=1;i<=n;i++)
 83             {
 84                 insert(0,i,1,0);
 85                 insert(i+n,T,1,0);
 86                 insert(0,i+n,1,a[i]);
 87             }
 88         for (int i=1;i<=m;i++)
 89            {
 90               int u,v,w;
 91            scanf("%d%d%d",&u,&v,&w);
 92            if (u>v) swap(u,v);
 93            insert(u,v+n,1,w);
 94            }
 95
 96        while (spfa())
 97        mcf();
 98        printf("%d\n",ans);
 99        return 0;
100    }