#include <fstream>
#include <vector>
#include <queue>
#define inf 2000000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,d[50001],x,y,c;
bool viz[50001];
struct cmp
{
    bool operator () (int a , int b)
    {
        return d[a]>d[b];
    }
};
priority_queue <int , vector<int> , cmp> h;
vector <pair<int,int> > g[50001];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g[x].push_back({y,c});
    }
    for(int i=2;i<=n;i++)
        d[i]=inf;
    h.push(1);
    while(!h.empty())
    {
        int nod=h.top();
        h.pop();
        if(viz[nod]==1)
            continue;
        for(int i=0;i<g[nod].size();i++)
        {
            int nou=g[nod][i].first;
            int cost=g[nod][i].second;
            if(d[nou]>d[nod]+cost)
            {
                d[nou]=d[nod]+cost;
                h.push(nou);
                viz[nou]=0;
            }
        }
    }
    for(int i=2;i<=n;i++)
        if(d[i]==inf)
            fout<<"0 ";
        else
            fout<<d[i]<<' ';
    return 0;
}