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

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,viz[50005];
vector <int> G[50005],C[50005];
long long d[50005];
struct cmp {
    bool operator()(int x,int y)
    {
        return d[x]>d[y];
    }
};
void dijkstra(int start)
{
    priority_queue <int, vector<int>, cmp> Q;
    d[start]=0;
    viz[start]=1;
    Q.push(start);
    while(!Q.empty())
    {
        int v=Q.top();
        viz[v]=0;
        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(!viz[j])
                {
                    viz[j]=1;
                    Q.push(j);
                }
            }
        }
        Q.pop();
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        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];
    }
}