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

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

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

void bf(int nod)
{
    q.push_back(nod);
    while(!q.empty())
    {
        nod=q.front();
        q.pop_front();
        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_back(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=2;i<=n;++i) dr[i]=INF;
    bf(1);
    for(int i=2;i<=n;++i)
        if(dr[i]==INF)
            g<<0<<' ';
        else
            g<<dr[i]<<' ';
    f.close();
    g.close();
    return 0;
}