#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
typedef long long ll;
const int DIM = 50010,INF=0x3f3f3f3f;

class cmp{
public:
    bool operator()(pair <int,int> &a, pair <int,int> &b)
    {
        return a.second>b.second;
    }
};

priority_queue <pair<int,int>, vector<pair<int,int>>, cmp> pq;

int n,m,x,y,z;
vector <pair<int,int>>graf[DIM];
int dist[DIM];

void initialise(int p)
{
    for(int i=1;i<=n;i++)
        if(i!=p)
        dist[i] = INF;
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>z;
        graf[x].push_back(make_pair(y,z));
    }
    initialise(1);
    pq.push(make_pair(1,dist[1]));
    while(pq.size())
    {
        int node = pq.top().first;
        int cost = pq.top().second;
        pq.pop();
        if(dist[node]!=cost)
            continue;
        for(auto l : graf[node])
        {
            if(l.second + cost < dist[l.first])
            {
                dist[l.first] = cost+l.second;
                pq.push(make_pair(l.first,dist[l.first]));
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(dist[i]!=INF)
            fout<<dist[i]<<" ";
        else
            fout<<0<<" ";
    }
}