#include <iostream>

#include <cstdio>

#include <algorithm>

#include <queue>

#include <cstring>

using namespace std;

typedef long long LL;

#define SZ 411000

int head[SZ],nxt[SZ],tot = ;

struct edge

{

    int t;

    LL d;

}l[SZ];

void build(int f,int t,LL d)

{

    l[++ tot] = (edge){t,d};

    nxt[tot] = head[f];

    head[f] = tot;

}

struct node

{

    int u;

    LL d;

};

bool vis[SZ];

LL dist[SZ];

priority_queue<node> q;

bool operator < (node a, node b) {return a.d > b.d; }

int main()

{

    int n, m, v, u;

    LL w;

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

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

    {

        scanf("%d %d %lld", &v, &u, &w);

        build(v, u, w);

        build(u, v, w);

    }

    for(int i = ; i <= n; i++) scanf("%lld", &dist[i]), q.push((node){i, dist[i]} );

    while(q.size())

    {

        int u = q.top().u;

        q.pop();

        if(vis[u]) continue;

        vis[u] = ;

        for(int i = head[u]; i;i = nxt[i])

        {

            int v = l[i].t;

            if(dist[v] > dist[u] +  * l[i].d)

            {

                dist[v] = dist[u] +  * l[i].d;

                q.push((node){v, dist[v]});

            }

        }

    }

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

    {

        if(i != ) printf(" ");

        printf("%lld", dist[i]);

    }

    printf("\n");

    return ;

}