#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("djikstra.in");
ofstream cout("djikstra.out");
int n,m;
int x,y,c;
vector<vector<pair<int,int> > > A;
vector<int> M;
struct cmp{
    bool operator () (const int &a ,const int &b)
    {
        return M[a]>M[b];
    }
};
vector<bool> fr;
int main()
{
    cin>>n>>m;
    A.resize(n+1);
    M.resize(n+1);
    fr.resize(n+1);
    for(int i=0;i<m;i++)
    {
        cin>>x>>y>>c;
        A[x].push_back({y,c});
    }
    for(int i=1;i<=n;i++)
       M[i]=0x3f3f3f3f;
    M[1]=0;
    fr[1]=1;
    priority_queue<int,vector<int>,cmp> Q;
    Q.push(1);
    while(!Q.empty())
    {
        int cap=Q.top();
        Q.pop();
        for(int i=0;i<A[cap].size();i++)
        {
            int vecin=A[cap][i].first;
            int new_cost=M[cap]+A[cap][i].second;
            if(new_cost<M[A[cap][i].first])
            {
                M[vecin]=new_cost;
                if(!fr[vecin])
                {
                Q.push(vecin);
                fr[vecin]=1;
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
       if(M[i]==0x3f3f3f3f)
          cout<<0<<" ";
        else
         cout<<M[i]<<" ";
    return 0;
}