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

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

struct bla
{
    int ve,co;
};
vector <bla> graph[N];
int dr[N];
bool viz[N];
struct cmp
{
    bool operator()(bla A, bla B)
    {
        return (A.co>B.co);
    }
};
priority_queue <bla, vector <bla>, cmp> q;

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