#include <fstream>
#include <vector>
#include <deque>
#define N 50002
#define INF 2000000000

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

struct bla
{
    int ve,co;
};
bool been[N];
int d[N];
deque <int> q;
vector <bla> graph[N];
void bf(int nod)
{
    int vee;
    q.push_back(nod);
    d[nod]=0;
    while(!q.empty())
    {
        nod=q.front();
        q.pop_front();
        for(int i=0;i<graph[nod].size();++i)
        {
            vee=graph[nod][i].ve;
            if(d[vee]>d[nod]+graph[nod][i].co)
            {
                d[vee]=d[nod]+graph[nod][i].co;
                q.push_back(vee);
            }
        }
    }
}
int main()
{
    int m,n,x,y,z;
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y>>z;
        graph[x].push_back({y,z});
    }
    for(int i=1;i<=n;++i) d[i]=INF;
    bf(1);
    for(int i=2;i<=n;++i)
        if(d[i]==INF)
    {g<<0<<' ';}
    else
        g<<d[i]<<' ';
    return 0;
}