#include <iostream>
#include <fstream>
#include <vector>
#include <climits>

//DON'T USE THIS AT CONTESTS!
#pragma GCC target ("avx,avx2,fma")
#pragma GCC optimize ("-march=native -O3 -pipe")

using namespace std;

ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
const int NMax=50005;
vector < pair<int, int> > g[NMax];
int n, m;
const int oo=INT_MAX;
int d[NMax];
bool use[NMax];

/*
Single source, single destination;
Single source, multiple destinations;
Multiple sources, multiple destinations;
*/

//Bellman Ford > Dijkstra (simplu, priority queue, liste) > Roy-Warshall-Floyd

inline void read()
{
    int x, y, c;
    fin>>n>>m;
    for (int i=1; i<=m; i++) {
        fin>>x>>y>>c;
        g[x].push_back({y, c});
    }
}

inline void dijkstra()
{
    for (int i=2; i<=n; i++) d[i]=oo;
    for (int i=1; i<=n; i++) {
        int mini=oo, nod;
        for (int i=1; i<=n; i++) {  //Putem to i, fiindca nu vom folosi i-ul din primul for.
            if (d[i]<mini&&!use[i]) {
                mini=d[i];
                nod=i;
            }
        }
        use[nod]=1;
        for (int i=0; i<g[nod].size(); i++) {
            int vecin=g[nod][i].first;
            int cost=g[nod][i].second;
            d[vecin]=min(d[vecin], d[nod]+cost);
        }
    }
}

inline void print()
{
    for (int i=2; i<=n; i++) {
        if (d[i]==oo) {
            fout<<0<<' ';
            cout << "inf";
        }
        else {
            fout<<d[i]<<' ';
        }
    }
}

int main()
{
    fin.tie(0); fin.sync_with_stdio(false);
    fout.tie(0); fout.sync_with_stdio(false);
    read();
    dijkstra();
    print();
    return 0;
}