#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector <pair <int, int> > v[50003];
struct cmp
{
    bool operator()(pair <int, int> a,pair <int, int> b)
    {
        if(a.second>=b.second)
            return true;
        else
            return false;
    }
};
priority_queue <pair <int, int>, vector <pair <int, int> >, cmp >q;
int d[50003];
int frq[50003];
void dijkstra(int st,int n)
{
    int i,cnt,poz,minn,urm,val,dst;
    for(i=1;i<=n;i++)
    {
        d[i]=2e9;
        frq[i]=0;
    }
    d[st]=0;
    q.push({1,0});
    while(q.empty()==false)
    {
        poz=q.top().first;
        dst=q.top().second;
        q.pop();
        for(i=0;i<v[poz].size();i++)
        {
            urm=v[poz][i].first;
            val=v[poz][i].second;
            if(d[urm]>d[poz]+val)
            {
                d[urm]=d[poz]+val;
                q.push({urm,d[urm]});
            }
        }
    }
}
int main()
{
    int n,m,i,x,y,z;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        v[x].push_back({y,z});
    }
    dijkstra(1,n);
    for(i=2;i<=n;i++)
    {
        if(d[i]==2e9)
        {
            d[i]=0;
        }
        g<<d[i]<<" ";
    }
    return 0;
}