#include <fstream>
#include <queue>
#include <vector>
using namespace std;
typedef pair <int, int>ii;
typedef vector <int>vi;
typedef vector <ii>vii;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int INF=2000000000;
const int NMAX=250000;
vector <ii>G[NMAX+5];
 vi dist(250000, INF );
priority_queue<ii, vector<ii>, greater<ii> >pq;
void dijkstra(int s)
{
    int d, u, v, duv, i;
    dist[s]=0;
    ii front;
    pq.push(ii(1, s));
    while(!pq.empty())
    {
        front=pq.top();
        pq.pop();
        d=front.first;
        u=front.second;
        if(d>dist[u])
            continue;
        for(i=0;i<G[u].size();i++)
        {
            v=G[u][i].first;
            duv=G[u][i].second;
            if(dist[u]+duv<dist[v])
            {
                dist[v]=dist[u]+duv;
                pq.push(ii(dist[v], v));
            }
        }
    }
}
int main()
{
   int n, m, x, y, i, c;
   fin>>n>>m;
   for(i=1;i<=m;i++)
   {
      fin>>x>>y>>c;
      G[x].push_back(ii(y, c));
   }
   dijkstra(1);
   for(i=2;i<n;i++)
   {
        if(dist[i]=INF)
            fout<<"0"<<" ";
        else
            fout<<dist[i]<<" ";
   }
    return 0;
}