#include <fstream>
#include <vector>
#include <queue>
#include <map>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
const int NMAX=50000;
const int INF=20001;
int drain[NMAX+1];
bool viz[NMAX+1];
auto cmp=[](pair<int,int>a,pair<int,int>b){return a.first<b.first;};
priority_queue<pair<int,int>,vector<pair<int,int>>, decltype(cmp)>q(cmp);
vector<int>g[NMAX+1];
int cost[NMAX+1][NMAX+1];
void dijkstra(int st)
{
    q.push({0,st});
    while(!q.empty())
    {
        pair<int,int>p=q.top();
        viz[p.second]=1;
        q.pop();
        for(auto x:g[p.second])
            if(drain[x]>drain[p.second]+cost[p.second][x])
            {
                drain[x]=drain[p.second]+cost[p.second][x];
                q.push({drain[x],x});
            }
    }
}
int main()
{
    int n,m;
    cin >> n >> m;
    for(int i=0;i<m;i++)
    {
        int x,y,d;
        cin >> x >> y >> d;
        cost[x][y]=d;
        g[x].push_back(y);
    }
    drain[1]=0;
    for(int i=2;i<=n;i++)
        drain[i]=INF;
    dijkstra(1);
    for(int i=2;i<=n;i++)
        cout << drain[i] << ' ';
    return 0;
}