R=range
J=lambda:map(int,input().split())
import heapq
from fractions import Fraction as F
N,M=J()
E=[[]for i in R(N+1)]
for j in R(M):u,v,a,b=J();E[u]+=[(v,F(a,b))];E[v]+=[(u,F(a,b))]
W=[F(9**20)]*(N+1)
W[1]=F(0)
S=[(F(0),1)]
while S:
	w,i=heapq.heappop(S)
	if w>W[i]:continue
	for j,v in E[i]:
		t=w+v
		if t<W[j]:W[j]=t;heapq.heappush(S,(t,j))
for i in R(2,N+1):print(W[i].numerator,W[i].denominator)