#include <bits/stdc++.h>
#define INF 2100000000
#define nod first
#define cost second
/// TONI BO$$ was here
/// #MLC

using namespace std;

vector < pair <int,int> > G[50001];
int mindist[50001];
priority_queue <int> q;

int main()
{
    int n,m,i,x,y,c;
    ios::sync_with_stdio(false);
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y>>c;
        G[x].push_back({y,c});
    }
    for(i=2; i<=n; i++)
        mindist[i]=INF;
    q.push(1);
    while(!q.empty())
    {
        int u=q.top();
        q.pop();
        for(auto w : G[u])
            if(mindist[w.nod]>mindist[u]+w.cost)
            {
                mindist[w.nod]=mindist[u]+w.cost;
                q.push(w.nod);
            }
    }
    for(i=2; i<=n; i++)
        if(mindist[i]!=INF)
            cout<<mindist[i]<<" ";
        else
            cout<<"0 ";

    return 0;
}