#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define f first
#define s second
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<pair<int,int> > v[50001];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > h;
int d[50001],n,m,a,b,c,x,i;
bool w[50001];
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        v[a].push_back(make_pair(c,b));
    }
    for(i=1;i<=n;i++)d[i]=1000000001;
    d[1]=0;
    h.push(make_pair(0,1));
    while(!h.empty())
    {
        x=h.top().s;
        h.pop();
        if(!w[x])
        {
            for(i=0; i<v[x].size(); i++)
            {
                if(d[x]+v[x][i].f<d[v[x][i].s])
                {
                    d[v[x][i].s]=d[x]+v[x][i].f;
                    h.push(make_pair(d[v[x][i].s],v[x][i].s));
                }
            }
        }
        w[x]=1;
    }
    for(i=2; i<=n; i++)
    {
        if(d[i]==1000000001) fout<<0<<" ";
        else fout<<d[i]<<" ";
    }
    return 0;
}