#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int nmax=5e4;
vector <pair <int,int> > v[nmax+5];
vector <int> dist;
bitset <50005> viz;
priority_queue <pair<int,int> > q;
const int inf=2e9;
int n,m;
void read()
{
    in>>n>>m;
    dist.resize(n+1,inf);
    for(int i=0; i<m; i++)
    {
        int a,b,c;
        in>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
}
void dijkstra(int src)
{
    dist[src]=0;
    q.push({0,src});
    while(!q.empty())
    {
        int node=q.top().second;
        q.pop();
        if(!viz[node])
        {
            viz[node]=1;
            for(int i=0; i<v[node].size(); i++)
            {
                if(!viz[v[node][i].first]  &&  dist[v[node][i].first] > dist[node]+v[node][i].second)
                {
                    dist[v[node][i].first]=dist[node]+v[node][i].second;
                    q.push({-dist[v[node][i].first],v[node][i].first});
                }
            }
        }
    }
}
int main()
{
    read();
    dijkstra(1);
    for(int i=2; i<=n; i++)
        if(dist[i]==inf)
            out<<0<<" ";
        else
            out<<dist[i]<<" ";
    return 0;
}