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

constexpr long long inf = 1001001001001001001;

bool chmin(long long &x,long long y) {
    if(x > y) {
        x = y;
        return true;
    }
    return false;
}

int main() {
    int N,M;
    cin >> N >> M;
    vector<vector<array<int,3>>>road(N);
    for(int i = 0; i < M; i++) {
        int A,B,C,X;
        cin >> A >> B >> C >> X;
        A--;
        B--;
        road[A].push_back({B,C,X});
        road[B].push_back({A,C,X});
    }
    vector<vector<long long>>dist(N,vector<long long>(2,inf));
    dist[N-1][0] = 0;
    priority_queue<array<long long,3>,vector<array<long long,3>>,greater<array<long long,3>>>que;
    que.push({0,N-1,0});
    while (!que.empty()) {
        array<long long,3> x = que.top();
        que.pop();
        if(dist[x[1]][x[2]] != x[0]) {
            continue;
        }
        for(int i = 0; i < road[x[1]].size(); i++) {
            int nxt = road[x[1]][i][0];
            if(chmin(dist[nxt][x[2]|road[x[1]][i][2]],x[0]+road[x[1]][i][1])) {
                que.push({dist[nxt][x[2]|road[x[1]][i][2]],nxt,x[2]|road[x[1]][i][2]});
            }
        }
    }
    for(int i = 0; i < N-1; i++) {
        cout << dist[i][1] << endl;
    }
}