#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=505;
ll e[N][N],n,m,dp[N][N],b[N];
struct node{
ll id,w;
const bool operator<(const node &a) {
return w<a.w;
}
}a[N];
int main(){
memset(dp,0x3f,sizeof dp);
memset(e,0x3f,sizeof e);
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++) scanf("%lld",&a[i].w),a[i].id=i,b[i]=a[i].w;
sort(a+1,a+1+n);
for(int i=1;i<=m;i++){
ll u,v,w;scanf("%lld%lld%lld",&u,&v,&w);
e[u][v]=e[v][u]=w;
dp[u][v]=dp[v][u]=min(dp[u][v],max(b[u],b[v])*w);
}
for(int i=1;i<=n;i++) dp[i][i]=e[i][i]=(ll)0;
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(e[i][j]>max(e[i][a[k].id],e[a[k].id][j])){
e[i][j]=max(e[i][a[k].id],e[a[k].id][j]);
dp[i][j]=min(dp[i][j],e[i][j]*max(b[i],max(b[j],a[k].w)));
}
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(e[i][j]>1e16) cout<<-1<<" ";
else cout<<dp[i][j]<<" ";
}
cout<<endl;
}
}