#include<fstream>
#include<vector>
#include<set>
#include<cstdlib>
#include<cstring>
#define In "dijkstra.in"
#define Out "dijkstra.out"
#define Nmax 50002
#define Inf 2147483647
using namespace std;
int sol[Nmax],n;
bool viz[Nmax];
vector<int >graf[Nmax],cost[Nmax];
set< pair<int,int> >H;
inline void Dijkstra()
{
    pair <int, int> nod;
    int curent, costcurent, co, vec, lim,i;
    H.insert(make_pair(0,1));
    while(!H.empty())
    {
        nod = *H.begin();
        H.erase(nod);
        curent = nod.second;
        costcurent = sol[curent];
        viz[curent] = true;
        lim = graf[curent].size();
        for(i=0;i<lim;i++)
        {
            vec = graf[curent][i];
            if(viz[vec])
                continue;
            co = costcurent + cost[curent][i];
            if(sol[vec]>co)
            {
                sol[vec] = co;
                H.insert(make_pair(sol[vec],vec));
            }
        }
    }
}
int main()
{
    int i,x,y,c,m;
    ifstream fin(In);
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        graf[x].push_back(y);
        cost[x].push_back(c);
    }
    for(i=2;i<=n;i++)
        sol[i] = Inf;
    ofstream fout(Out);
    Dijkstra();
    for(i=2;i<=n;i++)
        fout<<(sol[i]==Inf?0:sol[i])<<" ";
    fout<<"\n";
    fout.close();
    return 0;
}