#include<fstream>
#include<vector>
#include<queue>
#include<bitset>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
typedef pair<unsigned short,int> P;
vector<P> a[50001];
priority_queue<P,vector<P>,greater<P>> p;
bitset<50001> e;
int d[50001];
int main()
{
    unsigned short n,k=0;
    int m;
    for(cin>>n>>m;m--;) {
        int i,j,k;
        cin>>i>>j>>k,a[i].push_back({j,k});
    }
    for(int i=2;i<=n;d[i++]=2e9);
    for(p.push({0,1});!p.empty()&&k<n;p.pop()) {
        int i=p.top().second;
        if(!e[i]) {
            e[i]=1,++k;
            for(auto j:a[i])
                if(!e[j.first]&&d[j.first]>d[i]+j.second)
                    d[j.first]=d[i]+j.second,p.push({d[j.first],j.first});
        }
    }
    for(int i=2;i<=n;cout<<(d[i]==2e9?0:d[i])<<' ',++i);
    return 0;
}