// Original C++ solution (slower):
#include <cstdio>

#include <cstdlib>

#include <iostream>

#include <cstring>

#include <cmath>

#include <ctime>

#include <algorithm>

#include <vector>

#include <set>

#include <queue>

#include <map>

#include <stack>

#include <bitset>

using namespace std;

typedef int gitype;

gitype gi () {

    gitype ret=0; char ch=getchar();

    while((ch<'0' || ch>'9') && ch!='-') ch=getchar();

    char c=ch=='-'?getchar():ch;

    while(c>='0' && c<='9') ret=ret*10+c-'0',c=getchar();

    return ch=='-'?-ret:ret;

}

const int N = 10010;

const int M = 100010;

int n,m,st[N],vis[N],dis[N],pt[M],nxt[M],w[M],c[M],cost[N],ent=0;

void link (int u,int v,int _w,int _c) {

    pt[++ent]=v; nxt[ent]=st[u]; st[u]=ent; w[ent]=_w; c[ent]=_c;

    pt[++ent]=u; nxt[ent]=st[v]; st[v]=ent; w[ent]=_w; c[ent]=_c;

}

queue<int> q;

int main () {

    while(scanf("%d%d",&n,&m)==2 && (n || m)) {

        memset(st,0,sizeof(st)); ent=0;

        int u,v,_w,_c;

        for(int i=1;i<=m;i+=1) {

            u=gi(); v=gi(); _w=gi(); _c=gi(); link(u,v,_w,_c);

        }

        for(int i=1;i<=n;i+=1) dis[i]=1e9 + 5;

        dis[1]=0; q.push(1);

        while(!q.empty()) {

            int r=q.front(); q.pop(); vis[r]=false;

            for(int i=st[r];i;i=nxt[i]) {

                if(dis[pt[i]] > dis[r]+w[i]) {

                    dis[pt[i]] = dis[r]+w[i]; cost[pt[i]] = c[i];

                    if(!vis[pt[i]]) {

                        vis[pt[i]] = true; q.push(pt[i]);

                    }

                } else if(dis[pt[i]] == dis[r]+w[i]) {

                    cost[pt[i]] = min(cost[pt[i]], c[i]);

                }

            }

        }

        int ans = 0;

        for(int i=2;i<=n;i+=1) ans += cost[i];

        printf("%d\n",ans);

    }

    return 0;

}

// Optimized solution to the same problem (faster):
#include <cstdio>

#include <cstring>

#include <algorithm>



using namespace std;



const int inf = 0x3f3f3f3f;

const int N = 10414;

const int M = 40414;



struct Edge{

	int u, v, d, c;

	int next;

}edge[M];



int cnt, head[N];

int vis[N], dis[N], cost[N];

int op, tp, link[18014];



void add_edge(int u, int v, int d, int c);

void spfa(int n);



int main(){

	int n, m, i, u, v, d, c;

	while(~scanf("%d %d", &n, &m) && (n || m)){

		cnt = 0;

		memset(head, -1, sizeof(head));

		for(i = 0; i < m; i++){

			scanf("%d %d %d %d", &u, &v, &d, &c);

			add_edge(u, v, d, c);

			add_edge(v, u, d, c);

		}

		spfa(n);

	}

	return 0;

}

void add_edge(int u, int v, int d, int c){

	edge[cnt].u = u;

	edge[cnt].v = v;

	edge[cnt].d = d;

	edge[cnt].c = c;

	edge[cnt].next = head[u];

	head[u] = cnt++;

	return;

}

void spfa(int n){

	int i, u, v, d, c, sum;

	memset(vis, 0, sizeof(vis));

	memset(dis, inf, sizeof(dis));

	memset(cost, inf, sizeof(cost));

	op = tp = 0;

	vis[1] = 1, dis[1] = 0, cost[1] = 0;

	link[tp++] = 1;

	while(op < tp){

		u = link[op++];

		vis[u] = 0;

		for(i = head[u]; ~i; i = edge[i].next){

			v = edge[i].v, d = edge[i].d, c = edge[i].c;



			if(dis[v] > dis[u] + d || (dis[v] == dis[u] + d && cost[v] > c)){

				dis[v] = dis[u] + d;

				cost[v] = c;

				if(!vis[v]){

					vis[v] = 1;

					link[tp++] = v;

				}

			}

		}

	}

	sum = 0;

	for(i = 1; i <= n; i++){

		sum += cost[i];

	}

	printf("%d\n", sum);

	return;

}




// Fastest known solution for this problem: