#include<fstream>
#include<vector>
#include<queue>
#include<bitset>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
const int N=50001;
vector<pair<int,int>> a[N];
int d[N];
bitset<N> b;
struct C {
    bool operator()(int x,int y) {
        return d[x]>d[y];
    }
};
priority_queue<int,vector<int>,C> c;
int main()
{
    int m,n;
    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(c.push(1);!c.empty();) {
        int i=c.top();
        c.pop();
        for(auto j:a[i])
            if(d[i]+j.second<d[j.first]&&(d[j.first]=d[i]+j.second,!b[j.first]))
                c.push(j.first),b[j.first]=1;
    }
    for(int i=2;i<=n;cout<<(d[i]==2e9?0:d[i])<<' ',++i);
    return 0;
}