#include <bits/stdc++.h>
using namespace std;
struct edge{
    int to;
    long long cost;
};
typedef pair<long long, int> P;
int main(){
    int N, M;
    cin >> N >> M;
    vector<vector<edge>> G(N + 2 * M);
    vector<int> mon;
    for(int i = 0; i < M; i++){
        int a, b, x;
        long long c;
        cin >> a >> b >> c >> x;
        a--;
        b--;
        if(x == 1) {
            G[a].push_back({i + N, c});
            G[i + N].push_back({b, 0});
            G[b].push_back({i + M + N, c});
            G[i + M + N].push_back({a, 0});
            mon.push_back(i + N);
            mon.push_back(i + M + N);
        }
        else{
            G[a].push_back({b, c});
            G[b].push_back({a, c});
        }
    }
    long long INF = 10000000000000000;
    vector<long long> d(N + 2 * M, INF);
    priority_queue<P, vector<P>, greater<P>> q;
    d[N - 1] = 0;
    q.push({0, N - 1});
    while(!q.empty()){
        auto [dis, id] = q.top();
        q.pop();
        if(d[id] < dis) continue;
        for(edge e : G[id]){
            if(d[e.to] > e.cost + dis){
                d[e.to] = e.cost + dis;
                q.push({d[e.to], e.to});
            }
        }
    }
    vector<long long> ans(N + 2 * M, INF);
    for(int i = 0; i < (int)mon.size(); i++){
        q.push({d[mon[i]], mon[i]});
        ans[mon[i]] = d[mon[i]];
    }
    while(!q.empty()){
        auto [dis, id] = q.top();
        q.pop();
        if(ans[id] < dis) continue;
        for(edge e : G[id]){
            if(ans[e.to] > e.cost + dis){
                ans[e.to] = e.cost + dis;
                q.push({ans[e.to], e.to});
            }
        }
    }
    for(int i  = 0; i < N - 1; i++) cout << ans[i] << endl;
}