#include <fstream>
#include <queue>
#include <vector>
#define NM 200005
#define mp make_pair
#define oo 2100000000
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,nod,d[NM];
bool viz[NM];
vector <pair<int,int> > v[NM];
struct ok
{   bool operator()(int a,int b)
    {   return d[a]>d[b];   }
};
priority_queue <int,vector<int>,ok> coada;
void Dijkstra(int nod)
{   for(int i=1; i<=n; i++) d[i]=oo;
    d[nod]=0;
    coada.push(nod);
    viz[nod]=1;
    while(!coada.empty())
    {   int x=coada.top();
        coada.pop();
        viz[x]=0;
        for(unsigned int j=0; j<v[x].size(); j++)
        {   int ndv=v[x][j].first;
            int cost=v[x][j].second;
            if(cost+d[x]<d[ndv])
            {   d[ndv]=cost+d[x];
                if(!viz[ndv])
                {   coada.push(ndv);
                    viz[ndv]=1;
                }
            }
        }
    }
}
int main()
{   cin>>n>>m;
    while(m--)
    {   int x,y,val;
        cin>>x>>y>>val;
        v[x].push_back(mp(y,val));
        v[y].push_back(mp(x,val));
    }
    Dijkstra(1);
    for(int i=1;i<=n;i++)
        if(d[i]==2100000000)cout<<0<<" ";
          else cout<<d[i]<<" ";
}