#include <fstream>
#include <vector>
#include <queue>
#define INF 1000001
using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,ciclu[50001],coada[50001];
vector <int> G[50001],C[50001];
long long d[50001];
struct compara
{
    bool operator()(int x, int y)
    {
        return d[x]>d[y];
    }
};
void dijkstra(int start)
{
    priority_queue <int,vector<int>,compara> que;
    d[start]=0;
    coada[start] = 1;
    que.push(start);
    while(!que.empty())
    {
        int v = que.top();
        for(unsigned int i=0; i<G[v].size(); ++i)
        {
            int j = G[v][i];
            if(d[j] > d[v] + C[v][i])
            {
                d[j] = d[v] + C[v][i];
                if(!coada[j])
                {
                    coada[j]=1;
                    que.push(j);
                }
            }
        }
        que.pop();
    }
}
int main()
{
    cin>>n>>m;
    while(m--)
    {
        int x,y,c;
        cin>>x>>y>>c;
        G[x].push_back(y);
        C[x].push_back(c);
    }
    for(int i=2;i<=n;i++)
        d[i]=INF;
    dijkstra(1);
    for(int i=2;i<=n;i++,cout<<' ')
        {
            if(d[i]==INF) cout<<0;
            else cout<<d[i];
        }
    return 0;
}