#include<fstream>
#include<cstdio>
#include<vector>
#include<queue>
#include<climits>
#define pp pair<int,int>
using namespace std;
struct pri
{
    int operator() (const pair<int,int>&p1,const pair<int,int>&p2)
    {
        return p1.second<p2.second;
    }
}p;
int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    priority_queue<pp,vector<pp>,pri> q;
    int n;
    f>>n;
    vector<pp> a[n+1];
    int e,u,v,w,i;
    f>>e;
    for(i=0;i<e;i++)
    {
        f>>u>>v>>w;
        a[u].push_back(pp(v,w));
        a[v].push_back(pp(u,w));
    }
    int d[n+1];
    for(i=1;i<=n;i++)
        d[i]=INT_MAX;
    d[1]=0;
    q.push(pp(1,d[1]));
    while(!q.empty())
    {
        u=q.top().first;
        q.pop();
        int size=a[u].size();
        for(int i=0;i<size;i++)
        {
            v=a[u][i].first;
            w=a[u][i].second;
            if(d[v]>d[u]+w)
            {
                d[v]=d[u]+w;
                q.push(pp(v,d[v]));
            }
        }
    }
    for(i=1;i<=n;i++)
        g<<d[i]<<' ';
    g<<'\n';
    return 0;
}