// Slower C++ solution:
#include <iostream>

#include <queue>

#include <functional>

#include <cstring>

using namespace std;



struct edge{

    int v, d, c;

    edge(){}

    edge(int v, int d, int c) : v(v),d(d),c(c){}

};



int N, M;

const int INF = 0x3f3f3f3f;

typedef pair<int, int> P;//距?， ?点

int d[10665];



vector<edge> G[10665];



void dijkstra(int s){

    priority_queue<P, vector<P>,greater<P> > que;

    memset(d, INF, sizeof(d));

    d[s] = 0;

    que.push(P(0,s));

    while(!que.empty())

    {

        P p = que.top();

        que.pop();

        int q = p.second;

        if(d[q] < p.first) continue;

        for(int i = 0; i < G[q].size(); i++)

        {

            edge e = G[q][i];

            if(d[e.v] > d[q] + e.d)

            {

                d[e.v] = d[q] + e.d;

                que.push(P(d[e.v], e.v));

            }

        }

    }

}





int main()

{

    while(cin >> N >> M)

    {

        if(!N) break;

        for(int i = 0; i < N; i++)

		{

			G[i].clear();

		}

        for(int i = 0; i < M; i++)

        {

            int u,t,c,d;

            cin >> u >> t >> d >> c;

            u--;t--;

            G[u].push_back(edge(t,d,c));

            G[t].push_back(edge(u,d,c));

        }

        dijkstra(0);

        int ans=0;

        for(int k = 1; k < N; k++)

        {

            int mincost = INF;

            for(int j = 0; j < G[k].size(); j++)

            {

                if(d[G[k][j].v]+G[k][j].d == d[k]

                 && G[k][j].c < mincost)

                    mincost = G[k][j].c;

            }

            ans += mincost;

        }

        cout << ans << endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.331154515441097x):
#include <cstdio>

#include <cstring>

#include <algorithm>



using namespace std;



constexpr int maxN = 10005;

constexpr int maxM = 400005;



int N, M;



int adj[maxN], gto[maxM], gnxt[maxM], length[maxM], cost[maxM], e;

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

    gto[e] = v; length[e] = d; cost[e] = c; gnxt[e] = adj[u]; adj[u] = e++;

}



void print_edge(int s) {

    printf("%d:", s);

    for (int e = adj[s]; ~e; e = gnxt[e])

        printf(" %d", gto[e]);

    putchar('\n');

}



int dis[maxN], pre[maxN];

int qu[maxN], qh, qt; bool inq[maxN];

void bellman_ford(int s) {

    memset(dis, 0x3f, sizeof dis); dis[s] = 0;

    for (inq[qu[qh = qt = 0] = s] = 1; qh <= qt; inq[qu[qh++ % N]] = 0)

        for (int u = qu[qh % N], e = adj[u], v = gto[e]; ~e; v = gto[e = gnxt[e]])

            if (dis[v] > dis[u] + length[e]) {

                dis[v] = dis[u] + length[e];

                pre[v] = cost[e];

                if (!inq[v]) inq[qu[++qt % N] = v] = 1;

            } else if (dis[v] == dis[u] + length[e]) {

                pre[v] = min(pre[v], cost[e]);

            }

}



int main() {

    while (~scanf("%d%d", &N, &M) && (N || M)) {

        memset(adj, -1, sizeof adj);

        for (int i = 0; i != M; ++i) {

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

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

        }

        bellman_ford(1);

        long long ans = 0;

        for (int i = 1; i <= N; ++i) ans += pre[i];

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

    }

    return 0;

}