#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<bitset>
#include<set>
#include<ctime>
#include<random>
#include<cassert>
#define IOS ios::sync_with_stdio(false)
#define PY puts("Yes")
#define PN puts("No")
#define PW puts("-1")
#define P0 puts("0")
#define P__ puts("")
#define PU puts("--------------------")
#define mp make_pair
#define fi first
#define se second
#define pc putchar
#define pb emplace_back
#define un using namespace
#define popc __builtin_popcountll
#define all(x) x.begin(),x.end()
#define rep(a,b,c) for(int a=(b);a<=(c);++a)
#define per(a,b,c) for(int a=(b);a>=(c);--a)
#define reprange(a,b,c,d) for(int a=(b);a<=(c);a+=(d))
#define perrange(a,b,c,d) for(int a=(b);a>=(c);a-=(d))
#define graph(i,j,k,l) for(int i=k[j];i;i=l[i].nxt)
#define lowbit(x) (x&-x)
#define lson(x) (x<<1)
#define rson(x) (x<<1|1)
#define mem(x,y) memset(x,y,sizeof x)
//#define double long double
//#define int long long
//#define int __int128
using namespace std;
using i64=long long;
using u64=unsigned long long;
using pii=pair<int,int>;
inline int rd(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-48;ch=getchar();}return x*f;
}
template<typename T>
inline void write(T x,char ch='\0'){
	if(x<0){x=-x;putchar('-');}
	int y=0;char z[40];
	while(x||!y){z[y++]=x%10+48;x/=10;}
	while(y--)putchar(z[y]);if(ch!='\0')putchar(ch);
}
bool Mbg;
const int maxn=55,maxm=2505,inf=0x3f3f3f3f;
const long long llinf=0x3f3f3f3f3f3f3f3f;
int n,m,a[maxm];
vector<pii>G[maxn];
int dis[maxn];
void bfs(){
	queue<int>que;
	rep(i,1,n)dis[i]=-1;
	que.push(1),dis[1]=0;
	while(!que.empty()){
		int x=que.front();que.pop();
		for(pii i:G[x]){
			int u=i.fi;
			if(dis[u]==-1){
				dis[u]=dis[x]+1;
				que.push(u);
			}
		}
	}
}
int cnt[maxm];
int ans[maxn];
void dfs(int x,int res){
	for(pii i:G[x]){
		int u=i.fi,c=i.se;
		if(dis[u]!=dis[x]+1)continue;
		++cnt[c];
		ans[u]=min(ans[u],res+cnt[c]*a[c]);
		dfs(u,res+cnt[c]*a[c]);
		--cnt[c];
	}
}
inline void solve_the_problem(){
	n=rd(),m=rd();
	rep(i,1,m)a[i]=rd();
	rep(i,1,m){
		int x=rd(),y=rd(),z=rd();
		G[x].emplace_back(mp(y,z)),G[y].emplace_back(mp(x,z));
	}
	bfs();
	mem(ans,0x3f);
	ans[1]=0;
	dfs(1,0);
	rep(i,2,n)write(ans[i],10);
}
bool Med;
signed main(){
//	freopen(".in","r",stdin);freopen(".out","w",stdout);
//	fprintf(stderr,"%.3lfMB\n",(&Mbg-&Med)/1048576.0);
	int _=1;
	while(_--)solve_the_problem();
}
/*

*/