#include <bits/stdc++.h>
using namespace std;

struct directedGraph{
    int N;
    vector<int> edgesValue;
    vector<vector<int>> edges;
    directedGraph(int n){
        N=n;
    }
    void addEdge(int a,int b,int value=0){
        edges.emplace_back((vector<int>){a,b});
        edgesValue.emplace_back(value);
    }
    vector<vector<int>> getConnection(){
        vector<vector<int>> ret(N,vector<int>(0));
        for(vector<int> v:edges){
            ret[v[0]].emplace_back(v[1]);
        }
        return ret;
    }
    vector<int> dijkstra(int start){
        vector<vector<int>> connection=getConnection();
        map<int,int> cost;
        for(int i=edges.size()-1;i>=0;--i){
            cost[edges[i][0]*N+edges[i][1]]=edgesValue[i];
        }
        vector<int> ret(N,INT_MAX);
        auto comp=[](vector<int> a,vector<int> b) {
            return a[1]>b[1];
        };
        priority_queue<vector<int>,vector<vector<int>>,decltype(comp)> que{comp};
        que.push((vector<int>){start,0});
        ret[start]=0;
        while(!que.empty()){
            vector<int> temp=que.top();
            que.pop();
            for(int i:connection[temp[0]]){
                if(cost[temp[0]*N+i]+ret[temp[0]]<ret[i]){
                    ret[i]=cost[temp[0]*N+i]+ret[temp[0]];
                    que.push((vector<int>){i,ret[i]});
                }
            }
        }
        return ret;
    }
};


int main(){
    int N,M,A,B,C,T;
    cin>>N>>M;
    directedGraph G(N*2);
    for(int i=0;i<M;++i){
        cin>>A>>B>>C>>T;
        --A;
        --B;
        if(T){
            G.addEdge(A+N,B,C);
            G.addEdge(A,B,C);
            G.addEdge(B+N,A,C);
            G.addEdge(B,A,C);
        }else{
            G.addEdge(A,B,C);
            G.addEdge(A+N,B+N,C);
            G.addEdge(B,A,C);
            G.addEdge(B+N,A+N,C);
        }
    }
    vector<int> ans=G.dijkstra(2*N-1);
    for(int i=0;i<N-1;++i){
    	cout<<ans[i]<<endl;
    }
}