#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fi("dijkstra.in");
ofstream fo("dijkstra.out");
int n,m,d[50001];
bool vz[50001];
const int inf = 1<<29;
struct comp{
    bool operator()(int x, int y)
    {
        return (d[x] > d[y]);
    }
};
priority_queue<int,vector<int>,comp> q;
vector< pair<int,int> >v[50001];
void Dijkstra(int p)
{
    int i,nod,cost,vecin;
    size_t j;
    for(i=1; i<=n; i++)
        d[i] = inf;
    d[p] = 0;
    vz[p] = true;
    q.push(p);
    while(!q.empty())
    {
        nod = q.top();
        q.pop();
        vz[nod] = false;
        for(j=0; j<v[nod].size(); j++)
        {
            vecin = v[nod][j].first;
            cost = v[nod][j].second;
            if(d[vecin] > d[nod] + cost)
            {
                d[vecin] = d[nod] + cost;
                if(!vz[vecin])
                {
                    vz[vecin] = true;
                    q.push(vecin);
                }
            }
        }
    }
}
int main()
{
    int x,y,c;
    fi >> n >> m;
    while(fi >> x >> y >> c)
        v[x].push_back(make_pair(y,c));
    Dijkstra(1);
    for(int i=2; i<=n; i++)
    {
        if(d[i] == inf)
            fo << 0 << " ";
        else fo << d[i] << " ";
    }
    return 0;
}