#include <fstream>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
#define INF 2000000000
vector< vector< vector<unsigned int> > > Graph;
vector<unsigned int> Visited;
int n, m, s;

void Read(){
    ifstream f ("dijkstra.in");
    f >> n >> m;
    s = 1;
    Graph.resize(n+1);
    int x, y, z;
    vector<unsigned int> temp(2);
    for(int i = 1; i <= m; ++i){
        f >> x >> y >> z;
        temp[0] = y; temp[1] = z;
        Graph[x].push_back(temp);
    }
    f.close();
}
void Dijkstra(){
    queue<unsigned int> Que;
    Visited.resize(n+1, INF);
    Visited[s] = 0;
    Que.push(s);
    vector< vector<unsigned int> >::iterator it;
    vector<unsigned int> temp;
    while(!Que.empty()){
        for(it = Graph[Que.front()].begin(); it != Graph[Que.front()].end(); ++it){
            temp = *it;
            cout << temp[0] << " " << temp[1] << "\n";
            if(Visited[temp[0]] == INF)
                Que.push(temp[0]);
            if(Visited[temp[0]] > Visited[Que.front()] + temp[1])
                Visited[temp[0]] = Visited[Que.front()] + temp[1];
        }
        Que.pop();
    }
}
void Write(){
    ofstream g ("dijkstra.out");
    for(int i = 2; i <= n; ++i){
        if(Visited[i] == INF) g << "0 ";
        else g << Visited[i] << " ";
    }
    g << "\n";
    g.close();
}
int main(){
    Read();
    Dijkstra();
    Write();
}