#include <iostream>
#include<bits/stdc++.h>

using namespace std;

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

const int NMAX=50005, inf=1e6;
vector < pair < int, int > > Edge[NMAX];
priority_queue < pair < int, int > > Q;
int D[NMAX];
bool viz[NMAX];
int n, m;

void Read()
{
    int x, y, c;
    in>>n>>m;
    for(int i=1; i<=m; i++)
        in>>x>>y>>c, Edge[x].push_back(make_pair(y, c));
}

void Dijkstra()
{
    Q.push({0, 1});
    int x;
    while(!Q.empty())
    {
        x=Q.top().second;
        Q.pop();
        if(viz[x]==0)
        {
            for(auto it : Edge[x])
                if(D[x]+it.second<D[it.first])
                {
                    D[it.first]=D[x]+it.second;
                    Q.push({-D[it.first], it.first});
                }
            viz[x]=1;
        }
    }
}

int main()
{
    Read();
    memset(D, inf, sizeof(D));
    D[1]=0;
    Dijkstra();
    for(int i=2; i<=n; i++)
        if(D[i]==inf)
            out<<0<<' ';
        else
            out<<D[i]<<' ';
    return 0;
}