#include <fstream>
#include <vector>
#include <Queue>
using namespace std;
ifstream in("dijkstra.in"); ofstream out("dijkstra.out");
vector <pair<int,int> > A[50001];
queue <int> Q;
int d[50001];
int main()
{   int n,m;
    in>>n>>m;
    for(int x,y,c,i=1;i<=m;i++)
    {   in>>x>>y>>c;
        A[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;i++) d[i]=1<<30;
    Q.push(1);
    while(!Q.empty())
    {   int node=Q.front(); Q.pop();
        for (int i=0;i<A[node].size();i++) {
            if (d[node]+A[node][i].second<d[A[node][i].first])
            {   d[A[node][i].first]=d[node]+A[node][i].second;
                Q.push(A[node][i].first);
            }
        }
    }
    for(int i=2;i<=n;i++)
        if (d[i]==1<<30) out<<"0 "; else out<<d[i]<<" ";
    out.close();
    return 0;
}