#include<fstream>
#include<vector>
#include<set>
#include<cstdlib>
#include<cstring>
#define In "dijkstra.in"
#define Out "dijkstra.out"
#define Inf 2147483647
#define Nmax 50002
using namespace std;
int sol[Nmax],n;
vector<pair<int,int> >graf[Nmax];
set< pair<int,int> >S;
inline void Citire()
{
    int x,y,c,m;
    ifstream fin(In);
    char s[100],*p;
    fin.getline(s,100);
    p = strtok(s," ");
    n = atoi(p);
    p = strtok(NULL," ");
    m = atoi(p);
    while(m--)
    {
        fin.getline(s,100);
        p = strtok(s," ");
        x = atoi(p);
        p = strtok(NULL," ");
        y = atoi(p);
        p = strtok(NULL," ");
        c = atoi(p);
        graf[x].push_back(make_pair(c,y));
    }
}

inline void Init()
{
    for(int i=2;i<=n;i++)
        sol[i] = Inf;
}

inline void Dijkstra()
{
    pair<int,int> poz,vec;
    S.insert(make_pair(0,1));
    vector< pair<int,int> >::iterator it;
    set< pair<int,int> >::iterator its;
    int nod,cost;
    while(!S.empty())
    {
        its = S.begin();
        poz = *its;
        S.erase(its);
        nod = poz.second;
        cost = sol[nod];
        for(it=graf[nod].begin();it!=graf[nod].end();it++)
        {
            vec = *it;
            if(sol[vec.second]>cost + vec.first)
            {
                sol[vec.second] = cost + vec.first;
                S.insert(vec);
            }
        }
    }
}

inline void Afis()
{
    ofstream fout(Out);
    for(int i=2;i<=n;i++)
        fout<<(sol[i]==Inf?0:sol[i])<<" ";
    fout<<"\n";
    fout.close();
}
int main()
{
    Citire();
    Init();
    Dijkstra();
    Afis();
    return 0;
}