import heapq

INF = 1 << 60

n, m = map(int, input().split())
g = [[] for _ in range(2 * n)]
for _ in range(m):
  a, b, c, x = map(int, input().split())
  a -= 1
  b -= 1
  if x == 0:
    g[a].append((b, c))
    g[b].append((a, c))
    g[a + n].append((b + n, c))
    g[b + n].append((a + n, c))
  else:
    g[a + n].append((b, c))
    g[b + n].append((a, c))
    g[a].append((b, c))
    g[b].append((a, c))

src = 2 * n - 1
dist = [INF for _ in range(2 * n)]
dist[src] = 0
hp = [(0, src)]
while len(hp) > 0:
  cd, cur = heapq.heappop(hp)
  if cd > dist[cur]:
    continue

  for nxt, c in g[cur]:
    if dist[cur] + c < dist[nxt]:
      dist[nxt] = dist[cur] + c
      heapq.heappush(hp, (dist[nxt], nxt))

print(*dist[:n - 1], sep='\n')