#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#define nmax 50002
#define inf 100000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

class cmp{
public:
    bool operator() (pair <int,int > A, pair <int,int> B)
    {
        return A.second<B.second;
    }
};

priority_queue <pair<int, int> , vector <pair <int,int > >,cmp>  coada;

vector <pair<int ,int> > graf[nmax];

int dist[nmax];
bitset <nmax> vizitat;

int main()
{
    int n,m,x,y,c;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        graf[x].push_back(make_pair(y,c));
    }
    for(int i=1;i<=n;i++)
    {
        dist[i]=inf;
    }
    dist[1]=0;
    coada.push(make_pair(1,0));
    while(!coada.empty())
    {
        int nod=coada.top().first;
        int cost=coada.top().second;
        coada.pop();
        vizitat[nod]=1;
        for(int i=0;i<graf[nod].size();i++)
        {
            int x=graf[nod][i].first;
            int y=graf[nod][i].second;
            int cs=dist[x];
            if(dist[x]>dist[nod]+y)
            {
                dist[x]=dist[nod]+y;
                coada.push(make_pair(x,dist[x]));
                if(cs!=inf)
                    coada.pop();
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(dist[i]==inf)
            dist[i]=0;
        fout<<dist[i]<<" ";
    }
    return 0;
}