#include<fstream>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<queue>
#define In "dijkstra.in"
#define Out "dijkstra.out"
#define Inf 2147483647
#define Nmax 50002
using namespace std;

struct Coord
{
    int nod,cost;
    bool operator <(const Coord &A) const
    {
        return cost>A.cost;
    }
};

int sol[Nmax],n;
vector<Coord>graf[Nmax];
priority_queue<Coord>q;

inline void Citire()
{
    int x,y,c,m;
    Coord Aux;
    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);
        Aux.nod = y; Aux.cost = c;
        graf[x].push_back(Aux);
    }
}

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

inline void Dijkstra()
{
    int curent,co;
    Coord poz,vec;
    poz.nod = 1;
    poz.cost = 0;
    q.push(poz);
    vector<Coord>::iterator it;
    while(!q.empty())
    {
        poz = q.top();
        q.pop();
        curent = poz.nod;
        co = sol[curent];
        for(it=graf[curent].begin();it!=graf[curent].end();it++)
        {
            vec = *it;
            if(sol[vec.nod]>co+vec.cost)
            {
                sol[vec.nod] = co+ vec.cost;
                q.push(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;
}