#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define INF numeric_limits<int>::max()
#define int64 long long
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
vector< vector< pair<int,int> > > adj;
vector<int> dist;
priority_queue< pair<int,int> , vector< pair<int,int> > , greater< pair<int,int> > > H;
int n;
void dijkstra(int x)
{
    dist=vector<int> (n+1,INF);
    dist[x]=0;
    H.push(mp(dist[x],x));
    while(!H.empty())
    {
        int nod=H.top().second;
        H.pop();
        for(auto it: adj[nod])
        if(dist[nod] + it.second < dist[it.first])
        {
            dist[it.first]=dist[nod] + it.second;
            H.push(mp(dist[it.first],it.first));
        }
    }
}
int main()
{
    int m;
    in>>n>>m;
    adj=vector< vector< pair<int,int> > > (n+1);
    for(;m;m--)
    {
        int x,y,z;
        in>>x>>y>>z;
        adj[x].pb(mp(y,z));
        //adj[y].pb(mp(x,z));
    }
    dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(dist[i]==INF)
            dist[i]=0;
        out<<dist[i]<<' ';
    }
    return 0;
}