#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int MAX=1e5+5;
const int INF=1e9;
int n,m,p,a,b,c,dist[MAX],inq[MAX];
struct T
{
    int nod,dist;
};
struct cmp
{
    bool operator ()(T a, T b)
    {
        return dist[a.nod]>dist[b.nod];
    }
};
priority_queue < T, vector < T >, cmp > q;
vector < T > v[MAX];

int main()
{
    fin >> n >> m;
    while(m--)
    {
        fin >> a >> b >> c;
        v[a].push_back({b,c});
    }
    for(int i=1;i<=n;i++)
        dist[i]=INF;
    dist[1]=0;
    q.push({1,0});
    while(!q.empty())
    {
        int nod=q.top().nod;
        inq[nod]=0;
        q.pop();
        for(auto vec : v[nod])
            if(dist[vec.nod]>dist[nod]+vec.dist)
            {
                dist[vec.nod]=dist[nod]+vec.dist;
                q.push({vec.nod,dist[vec.nod]});
                if(!inq[vec.nod])
                    inq[vec.nod]=1;
            }
    }
    for(int i=2;i<=n;i++)
        fout << (dist[i]==INF?0:dist[i]) << " ";
    return 0;
}