#include <fstream>
#include <queue>
#include <vector>
#define N 50005
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int distante[N],n,m,x,y,c;
const int INF = (1 << 30);
bool f[N];
vector < pair <int,int > > muchii[N];
struct compara
{
    bool operator()(int x,int y)
    {
        return (distante[x] > distante[y]);
    }
};
priority_queue <int, vector<int>, compara >q;
void Dijsktra(int nod)
{
    for(int i = 1; i <= n; i++)
        distante[i] = INF;
    distante[nod] = 0;
    q.push(nod);
    f[nod] = 1;
    while(!q.empty())
    {
        int nc = q.top();
        q.pop();
        f[nc] = 0;
        for(unsigned int i = 0; i < muchii[nc].size(); i++)
        {
            int vecin = muchii[nc][i].first;
            int cost = muchii[nc][i].second;
            if(distante[nc] + cost < distante[vecin])
            {
                distante[vecin] = distante[nc] + cost;
                if(f[vecin] == false)
                {
                    q.push(vecin);
                    f[vecin] = true;
                }
            }
        }
    }
}
int main()
{
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        cin >> x >> y >> c;
        muchii[x].push_back(make_pair(y,c));
    }
    Dijsktra(1);
    for(int i = 2; i <= n; i++)
    {
        if(distante[i] != INF)
        {
            cout << distante[i] << " ";
        }
        else
        {
            cout << 0 << " ";
        }
    }
    return 0;
}