///sol n^2
#include <bits/stdc++.h>
#include <fstream>
#define cin fin
#define cout fout
#define oo 1<<30
using namespace std;
ifstream cin ("dijkstra.in");
ofstream cout("dijkstra.out");
int n,i,j,k,l,m,a,b,c,cost[50008],uz[50008],cnt,minn;
struct compar
{
    bool operator ()(int a, int b)
    {
        return cost[a]>cost[b];
    }
};
vector<pair<int,int>>G[50008];
void dijkstra(int nod)
{
    for(int i=1;i<=n;i++)
    {
       cost[i]=oo;
    }
    cost[nod]=0;
    cnt=1;
    while(cnt<=n)
    {
        minn=oo;
        nod=-1;
        for(int i=1;i<=n;i++)
        {
            if(uz[i]==0)
            {
                if(minn>cost[i])
                {
                    minn=cost[i];
                    nod=i;
                }
            }
        }
        if(nod!=-1)
        {
            uz[nod]=1;
            for(auto i:G[nod])
            {
                if(cost[i.first]>cost[nod]+i.second)
                    cost[i.first]=cost[nod]+i.second;
            }
        }
        cnt++;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>a>>b>>c;
        G[a].push_back({b,c});
    }
    dijkstra(1);
    for(i=2;i<=n;i++)
    {
        if(cost[i]==oo)
            cout<<"0 ";
            else
            cout<<cost[i]<<" ";
    }
    return 0;
}