#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 4005
#define M 100005
#define INF 900000000
using namespace std;
struct linetree{int l,r,m;
}lt[M];
struct graph{int nxt,to,w;
}e[M<<1];
struct line{int l,r,w;
}a[M];
int g[N],dis[N],n,m,tot,cnt;
int f[N],p[N],dep[N],siz[N],son[N],top[N];
inline void addedge(int x,int y,int w){e[++cnt].nxt=g[x];g[x]=cnt;e[cnt].to=y;e[cnt].w=w;
}
inline void dfs1(int u){int m=0;siz[u]=1;for(int i=g[u];i;i=e[i].nxt)if(!dep[e[i].to]){f[e[i].to]=u;dep[e[i].to]=dep[u]+1;dis[e[i].to]=dis[u]+e[i].w;dfs1(e[i].to);siz[u]+=siz[e[i].to];if(siz[e[i].to]>m){son[u]=e[i].to;m=siz[e[i].to];}}
}
inline void dfs2(int u,int tp){top[u]=tp;p[u]=++cnt;if(son[u]) dfs2(son[u],tp);for(int i=g[u];i;i=e[i].nxt)if(e[i].to!=f[u]&&e[i].to!=son[u])dfs2(e[i].to,e[i].to);
}inline void build(int u,int l,int r){lt[u].l=l;lt[u].r=r;lt[u].m=INF;if(lt[u].l<lt[u].r){int mid=(lt[u].l+lt[u].r)>>1;build(u<<1,l,mid);build(u<<1|1,mid+1,r);}
}
inline void cover(int u,int l,int r,int k){if(lt[u].l>=l&&lt[u].r<=r){lt[u].m=min(lt[u].m,k);}else if(lt[u].l<lt[u].r){int lef=u<<1,rig=u<<1|1;int mid=(lt[u].l+lt[u].r)>>1;lt[lef].m=min(lt[u].m,lt[lef].m);lt[rig].m=min(lt[u].m,lt[rig].m);if(l<=mid) cover(lef,l,r,k);if(r>mid) cover(rig,l,r,k);}
}
inline int ask(int u,int x){if(lt[u].l<lt[u].r){int lef=u<<1,rig=u<<1|1;int mid=(lt[u].l+lt[u].r)>>1;lt[lef].m=min(lt[u].m,lt[lef].m);lt[rig].m=min(lt[u].m,lt[rig].m);if(x<=mid) return ask(lef,x);return ask(rig,x);}return lt[u].m;
}
inline void cov(int u,int v,int k){int t;while(top[u]!=top[v]){if(dep[top[u]]<dep[top[v]]){t=u;u=v;v=t;}cover(1,p[top[u]],p[u],k);u=f[top[u]];}if(p[u]>p[v]){t=u;u=v;v=t;}if(u!=v) cover(1,p[u]+1,p[v],k);
}
inline void Aireen(){scanf("%d%d",&n,&m);for(int i=1,j,k,w,t;i<=m;++i){scanf("%d%d%d%d",&j,&k,&w,&t);if(t){addedge(j,k,w);addedge(k,j,w);}else{a[++tot].l=j;a[tot].r=k;a[tot].w=w;}}dep[1]=1;dfs1(1);cnt=0;dfs2(1,1);build(1,1,n);m=tot;for(int i=1;i<=m;++i)cov(a[i].l,a[i].r,a[i].w+dis[a[i].l]+dis[a[i].r]);for(int i=2,k;i<=n;++i){k=ask(1,p[i]);if(k==INF) printf("-1 ");else printf("%d ",k-dis[i]);}
}
int main(){freopen("dis.in","r",stdin);freopen("dis.out","w",stdout);Aireen();fclose(stdin);fclose(stdout);return 0;
}