#include <fstream>
#include <queue>
#include <vector>
#define inf 100000000000
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector<pair<int,int> > v[50005];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >h;
int n,m,x,y,c;
long long d[50005];
bool viz[50005];
void dijkstra()
{
    h.push({0,1});
    while(!h.empty())
    {
        int nod=h.top().second;
        h.pop();
        if(!viz[nod])
        {
            for(int i=0;i<v[nod].size();++i)
            {
                if(d[nod]+v[nod][i].first<d[v[nod][i].second])
                {

                    d[v[nod][i].second]=d[nod]+v[nod][i].first;
                    h.push({ d[v[nod][i].second],v[nod][i].second});

                }
            }
        }
        viz[nod]=1;
    }
}
int main()
{
    int i,j;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        v[x].push_back({c,y});
    }
    for(i=2;i<=n;i++)
    {
        d[i]=inf;
    }
    dijkstra();
    for(i=2;i<=n;i++)
    {
        if(d[i]!=inf) g<<d[i]<<" ";
        else g<<0<<" ";
    }
    return 0;
}