#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int NMAX=50000;
const int INF= 200000;
struct muchie
{
    int nod, cost;
    bool operator <(const muchie& oth) const {
		return cost > oth.cost;
	}
};
priority_queue<muchie>pq;
vector<muchie>G[NMAX+5];
int dist[NMAX+5];
int n;
void Dijkstra()
{
   int i, j;
   for(i=2;i<=n;i++)
     dist[i]=INF;
    dist[1]=0;
    muchie a, b;
    a.nod=1;
    a.cost=0;
    pq.push(a);;
    while(!pq.empty())
    {
        a=pq.top();
        pq.pop();
        if(a.cost>dist[a.nod])
              continue;
        else
        {
            for(i=0;i<G[a.nod].size();i++)
            {
                b=G[a.nod][i];
                if(dist[a.nod]+b.cost<dist[b.nod])
                {
                    dist[b.nod]=dist[a.nod]+b.cost;
                    b.cost=dist[b.nod];
                    pq.push(b);
                }
            }
        }
    }

}

int main()
{
    int m, i, x, y;
    muchie a;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>a.cost;
        a.nod=x;
        G[y].push_back(a);
        a.nod=y;
        G[x].push_back(a);
    }
    Dijkstra();
    for(i=2;i<=n;i++)
    {
        if(dist[i]==INF)
            fout<<"0"<<" ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}