#include <iostream>

#include <cstdio>

#include <algorithm>

#include <queue>

#include <vector>

using namespace std;

typedef long long ll;

const int maxn = +;

vector<pair<int,ll> >mp[maxn];

priority_queue<pair<ll,int> >q;

ll dis[maxn];

int main(){

    int n,m;

    scanf("%d%d",&n,&m);

    for(int i=;i<=m;i++)

    {

        int u,v;

        ll c;

        scanf("%d%d%I64d",&u,&v,&c);    //因为long long 和int ；还有%I64d，wa了多次；

        mp[u].push_back(make_pair(v,c*));

        mp[v].push_back(make_pair(u,c*));

    }

    for(int i=;i<=n;i++)

    {

        ll x;

        scanf("%I64d",&x);

        dis[i]=x;

        q.push(make_pair(-dis[i],i));

    }

    while(!q.empty())

    {

            int now = q.top().second;

            ll w = q.top().first;

            q.pop();

           if(dis[now] != -w)continue;          //这一步也比较重要；既然这个点被其他点松弛过，就不能去松弛别点；

            for(int t=;t<mp[now].size();t++)

            {

                int to = mp[now][t].first;

                if(dis[to]>dis[now]+mp[now][t].second)

                {

                    dis[to]=dis[now]+mp[now][t].second;

                    q.push(make_pair(-dis[to],to));

                }

            }

    }

    for(int i=;i<=n;i++)

    {

       printf("%I64d%c",dis[i],i==n?'\n':' ');

    }

    return ;

}