#include <fstream>
#define N 50002
#include <vector>
#include <queue>
#define INF 2000000000

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

struct bla
{
    int ve,co;
};
vector <bla> graph[N];

struct how
{
    bool operator() (bla A, bla B)
    {
        return (A.co>B.co);
    }
};
priority_queue <bla, vector <bla>,how>q;

bool viz[N];
int d[N];

void dj()
{
    int nod;
    q.push({1,0});
    d[1]=0;
    while(!q.empty())
    {
        nod=q.top().ve;
        q.pop();
        if(!viz[nod])
        {
            for(int i=0;i<graph[nod].size();++i)
            {
                int vee=graph[nod][i].ve;
                if(d[vee]>d[nod]+graph[nod][i].co)
                {
                    d[vee]=d[nod]+graph[nod][i].co;
                    q.push({vee,d[vee]});
                }
            }
            viz[nod]=1;
        }
    }
}
int main()
{
    int m,n,x,y,z;
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y>>z;
        graph[x].push_back({y,z});
    }
    for(int i=1;i<=n;++i)
        d[i]=INF;
    dj();
    for(int i=2;i<=n;++i)
        if(d[i]==INF)
            g<<0<<' ';
        else
            g<<d[i]<<' ';
    return 0;
}