#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
int best[50001];
vector <pair <int,int> > g[50001];
const int inf = 1000000000;
class ComparVf
{
public:
    bool operator() (int&x, int&y)
    {
        return best[x]>best[y];
    }
};
priority_queue <int, vector<int> , ComparVf> q;
int main()
{
    ifstream fin ("dijkstra.in");
    ofstream fout ("dijkstra.out");
    int i,n,m,a,b,c,node;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        g[a].push_back(make_pair(b,c));
    }
    for(i=1;i<=n;i++)
        best[i]=inf;
    best[1]=0;
    q.push(1);
    while(!q.empty())
    {
        node=q.top();
        q.pop();
        a=g[node].size();
        for(i=0;i<a;i++)
        {
            if(best[g[node][i].first]>best[node]+g[node][i].second){
                best[g[node][i].first]=best[node]+g[node][i].second;
                q.push(g[node][i].first);
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(best[i]==inf)
            fout<<"0 ";
        else
            fout<<best[i]<<" ";
    }
    return 0;
}