#include<fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
vector < pair <int, int> >v[50001];
priority_queue <pair <int,int> >pq;
long long int n,m,dist[50001];
bool verif[50001];
int main()
{
    cin>>n>>m;long dist[n+1];
    for(int i=2;i<=n;i++)dist[i]=20001;
    dist[1]=0;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;cin>>a>>b>>c;
        v[a].push_back(make_pair(c,b));
        v[b].push_back(make_pair(c,a));
    }
    pq.push(make_pair(dist[1],1));
    while(!pq.empty())
    {
        long nod=pq.top().second;
        pq.pop();
        for(unsigned i=0;i<v[nod].size();i++)
        {
            long doi=v[nod][i].second;
            long d=v[nod][i].first;
            if(dist[doi]>dist[nod]+d){
                dist[doi]=d+dist[nod];
            pq.push(make_pair(dist[doi],doi));
            }
        }
    }
    for(int i=2;i<=n;i++)cout<<dist[i]<<" ";
}