#include <fstream>
#include <vector>
#define MAXN 50005
#define INF 2000000000
using namespace std;
ifstream fi("dijkstra.in");
ofstream fo("dijkstra.out");

int n,m;
vector < pair<int,int> > G[MAXN];
int dist[MAXN];
bool folosit[MAXN];
int main()
{
    fi>>n>>m;
    for (int i=1; i<=m; i++)
    {
        int u,v,c;
        fi>>u>>v>>c;
        G[u].push_back({v,c});
    }
    for (int i=2; i<=n; i++)
        dist[i]=INF;
    for (int rep=1; rep<=n; rep++)
    {
        int nod=0,cost=INF;
        for (int i=1; i<=n; i++)
            if (!folosit[i] && dist[i]<cost)
            {
                nod=i;
                cost=dist[i];
            }
        ///expandam pe nod
        folosit[nod]=1;
        for (auto copil: G[nod])
        {
            if (dist[nod]+copil.second<dist[copil.first])
            {
                dist[copil.first]=dist[nod]+copil.second;
            }
        }
    }
    for (int i=2; i<=n; i++)
        if (dist[i]==INF)
            fo<<"0 ";
        else
            fo<<dist[i]<<" ";
    return 0;
}