#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;#define inf 0x3f3f3f3f
#define maxn 566
#define maxm (566*566+2000)struct Edge{int u,v,w;
}e[maxm];
int in[maxn], pre[maxn];
int vis[maxn];
int belong[maxn];
int solve(int root,int n,int esz){// 1-basedint ret=0;while(1){for(int i=1;i<=n;++i) in[i]=inf;for(int i=1;i<=esz;++i){// 找最小边int u=e[i].u, v=e[i].v, w=e[i].w;if(v==u){swap(e[i--],e[esz--]);continue;}if(w<in[v])in[v]=w, pre[v]=u;}for(int i=1;i<=n;++i) if(in[i]==inf && i!=root) return inf;// 无解int cnt=0;memset(belong,-1,sizeof(belong));memset(vis,-1,sizeof(vis));in[root]=0;for(int i=1;i<=n;++i){// 找环ret+=in[i];int v = i;while(vis[v]!=i && belong[v]==-1 && v!=root)vis[v] = i, v = pre[v];if(vis[v]==i){// 有环，重新编号belong[v]=++cnt;for(int u=pre[v];u!=v;u=pre[u])belong[u]=cnt;}}if(cnt==0) break;// 已成型for(int i=1;i<=n;++i) if(belong[i]==-1) belong[i]=++cnt;// 不在环内，重新编号for(int i=1;i<=esz;++i){// 更新环外点和环缩点后的点的距离int v=e[i].v;e[i].u=belong[e[i].u];e[i].v=belong[e[i].v];if(e[i].u!=e[i].v) e[i].w-=in[v];}n=cnt;root=belong[root];}return ret;
}
int main(){int n,m;int a[55],s[55];while(~scanf("%d%d",&n,&m) && n+m){s[0]=1;for(int i=1;i<=n;++i) scanf("%d",a+i), s[i]=s[i-1]+a[i]+1;int esz=0;for(int i=0;i<m;++i){int c,l1,d,l2,w;scanf("%d%d%d%d%d",&c,&l1,&d,&l2,&w);int u=s[c-1]+l1+1, v=s[d-1]+l2+1;++esz;e[esz].u=u,e[esz].v=v,e[esz].w=w;}for(int i=1;i<=n;++i){++esz;e[esz].u=1,e[esz].v=s[i-1]+1,e[esz].w=0;for(int j=0;j<=a[i];++j){for(int k=0;k<j;++k){int u=s[i-1]+j+1,v=s[i-1]+k+1;++esz;e[esz].u=u,e[esz].v=v,e[esz].w=0;}}}int ans=solve(1,s[n],esz);if(ans==inf) puts("-1");else printf("%d\n",ans);}return 0;
}