#include <fstream>
#include <queue>
#include <vector>
#define dim 100010
#define inf 0x3f3f3f3f
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

int n,m,p;
int d[dim],v[dim];
vector<pair<int,int>>V[dim];

struct comp{
    bool operator()(int a,int b){
        return d[a]>d[b];
    }
};

priority_queue<int,vector<int>,comp>Q;

void dij(int p){
    for(int i=2;i<=n;++i)
        d[i]=inf;
    v[1]=1;
    Q.push(1);

    while(!Q.empty()){
        int nod=Q.top();
        Q.pop();

        for(auto vec:V[nod]){
            int nbr=vec.first;
            int cst=vec.second;

            if(d[nbr]>cst+d[nod])
            {
                d[nbr]=cst+d[nod];
                if(v[nbr]!=1)
                    Q.push(nbr),v[nbr]=1;
            }
        }
    }

    for(int i=2;i<=n;++i)
        if(d[i]!=inf) cout<<d[i]<<" ";
        else cout<<0<<" ";
}

int main()
{
    cin>>n>>m;
    for(;m;--m){
        int a,b,c;
        cin>>a>>b>>c;
        V[a].push_back({b,c});
    }

    dij(p);

    return 0;
}