#include <fstream>
#include <set>
#include <vector>
#include <climits>
#define DIM 50010
#define nod first
#define cost second
#define inf INT_MAX
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,x,y,z,k,i,d[DIM];
pair<int,int> vecin;
set< pair<int,int> > s;
vector< pair<int,int> > L[DIM];
int main() {
    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y>>z;
        L[x].push_back({y,z});
    }
    for (i=2;i<=n;i++)
        d[i]=inf;
    s.insert({0,1});
    while (!s.empty()) {
        k=s.begin()->second;
        s.erase(s.begin());
        for (i=0;i<L[k].size();i++) {
            vecin=L[k][i];
            if (d[vecin.nod]>d[k]+vecin.cost) {
                s.erase({d[vecin.nod],vecin.nod});
                d[vecin.nod]=d[k]+vecin.cost;
                s.insert({d[vecin.nod],vecin.nod});
            }
        }
    }
    for (i=2;i<=n;i++) {
        if (d[i]==inf)
            fout<<"0 ";
        else
            fout<<d[i]<<" ";
    }
}