#include <bits/stdc++.h>
#define pii pair <int,int>
#define INF 0x3f3f3f3f
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct str{
    int nod;
    int cost;
    bool operator <(const str&other)const
    {
        return cost>other.cost;
    }
};

priority_queue <str> pq;
int n,m,i,drum[50005];
vector <pii> v[50005];

void dijkstra()
{
    while(!pq.empty())
    {
        int nod=pq.top().nod;
        int cost=pq.top().cost;
        pq.pop();
        if(cost!=drum[nod])
            continue;
        for(auto it=v[nod].begin();it<v[nod].end();it++)
        {
            int nxt=(*it).first;
            int cst=(*it).second;
            if(drum[nod]+cst<drum[nxt])
            {
                drum[nxt]=drum[nod]+cst;
                pq.push({nxt,drum[nxt]});
            }
        }

    }
}

int main()
{
    fin>>n>>m;
    memset(drum,INF,sizeof(drum));
    for(i=1;i<=m;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    pq.push({1,0});
    drum[1]=0;
    dijkstra();
    for(i=2;i<=n;i++)
    {
        if(drum[i]==INF)
            fout<<0<<" ";
        else
            fout<<drum[i]<<" ";
    }
    return 0;
}