#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
/*
* 最小树形图
* 复杂度O(NM)
* 点下标[0,n-1] 边下标[0,m-1]
* 有向边表示：u->v 花费为cost
* 返回最小树形图的边权和，-1表示不存在最小树形图
*/
const int INF = 100000000;
const int MAXN = 1010; //点数
const int MAXM = 1010000;//边数
#define ll int
struct Edge{int u,v;ll cost;
}edge[MAXM];
int pre[MAXN],id[MAXN],visit[MAXN],edgenum;
void add(int u, int v, ll cost){Edge E = {u, v, cost}; edge[edgenum++] = E;
}ll in[MAXN];
ll zhuliu(int root,int n,int m,Edge edge[])//树根(注意是有向树，树根不能任意) 点数 边数 edge
{int u,v;ll res=0;while(1){for(int i = 0;i < n;i++)in[i] = INF;for(int i = 0;i < m;i++)if(edge[i].u != edge[i].v && edge[i].cost < in[edge[i].v]){pre[edge[i].v] = edge[i].u;in[edge[i].v] = edge[i].cost;}for(int i = 0;i < n;i++)if(i != root && in[i] == INF)return -1;//不存在最小树形图int tn = 0;memset(id,-1,sizeof(id));memset(visit,-1,sizeof(visit));in[root] = 0;for(int i = 0;i < n;i++){res += in[i];v = i;while( visit[v] != i && id[v] == -1 && v != root){visit[v] = i;v = pre[v];}if( v != root && id[v] == -1 ){for(int u = pre[v]; u != v ;u = pre[u])id[u] = tn;id[v] = tn++;}}if(tn == 0)break;//没有有向环for(int i = 0;i < n;i++)if(id[i] == -1)id[i] = tn++;for(int i = 0;i < m;){v = edge[i].v;edge[i].u = id[edge[i].u];edge[i].v = id[edge[i].v];if(edge[i].u != edge[i].v)edge[i++].cost -= in[v];elseswap(edge[i],edge[--m]);}n = tn;root = id[root];}return res; //-1为不存在最小树形图
}
void init(){edgenum = 0;
}
#define N 55
int n, m, a[N], sum[N];
int Hash(int i, int j){return sum[i-1]+j;
}
int main(){int i, j, c, l1, d, l2, cost;while(scanf("%d %d",&n,&m), n+m){init();sum[0] = 0;for(i = 1; i <= n; i++)scanf("%d",&a[i]), a[i]++, sum[i] = sum[i-1]+a[i];for(i = 1; i <= n; i++)add(0, Hash(i,1), 0);for(i = 1; i <= n; i++)for(j = 2; j <= a[i]; j++)add(Hash(i,j), Hash(i,j-1), 0);while(m--) {scanf("%d %d %d %d %d",&c, &l1, &d, &l2, &cost);l1++; l2++;add(Hash(c,l1), Hash(d,l2), cost);}printf("%d\n", zhuliu(0, sum[n]+1, edgenum, edge));}return 0;
}