#include <bits/stdc++.h>
#define Dmax 50005
#define inf 0x3F3F3F3F
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m,D[Dmax];
vector<pair<int,int> >G[Dmax];

priority_queue<pair<int,int>, vector<pair<int,int> >, greater< pair<int,int> > > Q;

void Dijkstra(int start)
{
    for(int i = 1; i <= n; i++)
        D[i] = inf;
    D[start]  = 0;
    Q.push({start,0});
    while(!Q.empty())
    {
        int x = Q.top().first;
        int y = Q.top().second;
        Q.pop();
        if(y > D[x])
            continue;
        for(vector<pair<int,int> >::iterator it = G[x].begin(); it < G[x].end(); it++)
        {
            if(D[it->first] > D[x] + it->second)
            {
                D[it->first] = D[x] + it->second;
                Q.push({it->first,D[it->first]});
            }
        }

    }




}



int main()
{
    f>>n>>m;
    for(int i = 1; i <= m; i++)
    {
        int x,y,z;
        f>>x>>y>>z;
        G[x].push_back({y,z});
    }

    Dijkstra(1);
    for(int i = 2; i <= n; i++)
        if(D[i]==inf)
        g<<"0 ";
        else
            g<<D[i]<<" ";

    return 0;
}