#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");
const int INF=1e9+5;
vector <pair <int,int>> lista[50010]; ///first=nod; second=cost
int dist[50010],viz[50010],n;
void dijkstra (int plecare)
{
    int i,nod,vecin,cost;
    for (i=1; i<=n; i++)
        dist[i]=INF;
    priority_queue <pair <int,long long>> dmin; ///first=nod; second=distanta
    dist[plecare]=1;
    dmin.push({plecare,0});
    while (dmin.size()>0)
    {
        nod=dmin.top().first;
        dmin.pop();
        if (viz[nod]==0)
        {
            viz[nod]=1;
            for (i=0; i<lista[nod].size(); i++)
            {
                vecin=lista[nod][i].first;
                cost=lista[nod][i].second;
                if (dist[nod]+cost<dist[vecin])
                {
                    dist[vecin]=dist[nod]+cost;
                    dmin.push({vecin,-dist[vecin]});
                }
            }
        }
    }
}
int main()
{
    int m,i,a,b,c;
    cin>>n>>m;
    for (i=1; i<=m; i++)
    {
        cin>>a>>b>>c;
        lista[a].push_back({b,c});
    }
    dijkstra(1);
    for (i=2; i<=n; i++)
    {
        if (dist[i]==INF)
            dist[i]=1;
        cout<<dist[i]-1<<" ";
    }
    return 0;
}