#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector<vector<tuple<int, int, bool>>> graph(n);
  while (m--) {
    int a, b, c, x; cin >> a >> b >> c >> x; --a; --b;
    graph[a].emplace_back(b, c, x);
    graph[b].emplace_back(a, c, x);
  }
  vector dist(n, vector(2, LINF));
  dist[n - 1][false] = 0;
  using P = pair<ll, pair<int, bool>>;
  priority_queue<P, vector<P>, greater<P>> que;
  que.emplace(0, make_pair(n - 1, false));
  while (!que.empty()) {
    auto [cost, ij] = que.top(); que.pop();
    auto [i, j] = ij;
    if (cost > dist[i][j]) continue;
    for (auto [dst, c, x] : graph[i]) {
      if (chmin(dist[dst][j | x], dist[i][j] + c)) que.emplace(dist[dst][j | x], make_pair(dst, j | x));
    }
  }
  REP(i, n - 1) cout << dist[i][true] << '\n';
  return 0;
}