#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct nodecost
{
    int node,cost;

    bool operator < (const nodecost other)const {

       return cost > other.cost;
    }
};

int n,m;
vector <nodecost> g[50005];
int dist[50005];
const int INF = 2e9;

priority_queue <nodecost> pq;

void dijkstra(int p)
{
    for(int i=1; i<=n; i++)
        dist[i] = INF;

    pq.push({p,0});

    while(!pq.empty())
    {
        int currnode=pq.top().node;
        int currdist=pq.top().cost;
        pq.pop();

        if(dist[currnode] == INF)
        {
            dist[currnode] = currdist;

            for(auto it : g[currnode])
            if(dist[it.node] == INF)
                pq.push({it.node, currdist + it.cost});
        }
    }

}


int main()
{
    fin>>n>>m;

    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        g[a].push_back({b,c});
    }

    dijkstra(1);

    for(int i=1;i<=n;i++)
        if(dist[i]==INF)
            fout<<0<<" ";
    else
        fout<<dist[i]<<" ";

    return 0;
}