#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
#define INF 21000000000
struct road{
    long long end,cost;
};
vector <road> v[50001];
priority_queue <pair<long long,long long>, vector<pair<long long,long long>>, greater<pair<long long,long long>>> q;
long long cost[50001];
bool viz[50001];
int main()
{
    int n,m;
    f>>n>>m;
    int x,y,c;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(int i=2;i<=n;i++)
        cost[i]=INF;
    q.push({0,1});
    int cr=n;
    while(!q.empty()&&cr)
    {
        int x=q.top().first,y=q.top().second; //cost,vf
        q.pop();
        if(!viz[y]){
        viz[y]=true;
        cr--;
        for(auto i:v[y])
            if(cost[i.end]>x+i.cost)
                {cost[i.end]=x+i.cost; q.push({cost[i.end],i.end});}}
    }
    for(int i=2;i<=n;i++)
        if(cost[i]!=INF)
            g<<cost[i]<<" ";
        else g<<0<<" ";
    return 0;
}