#include <fstream>
#include <vector>
#include <queue>
#define maxn 50005
#define INF 2000000005

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m, a, b, c, drum[maxn], nr[maxn];
bool viz[maxn];
vector <pair<int, int> > v[maxn];
queue <int> q;

void bf()
{
    q.push(1);
    for(int i=1; i<=n ; i++)
        drum[i]=INF;
    drum[1]=0;

    while(!q.empty())
    {
        int p=q.front();
        q.pop();
        for(int i=0; i<v[p].size(); i++)
            if(drum[v[p][i].first] > drum[p]+v[p][i].second)
         {
             drum[v[p][i].first]=drum[p]+v[p][i].second;
             q.push(v[p][i].first);
             //viz[v[p][i].first]=1;
         }
    }
}

int main()
{
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        fin >> a >> b >> c;
        v[a].push_back(make_pair(b, c));
    }

    bf();

    for(int i=1; i<=n; i++)
        if(drum[i]==INF)
        drum[i]=0;

    for(int i=1; i<n; i++)
        fout << drum[i+1] << ' ';

    return 0;
}