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

#include <queue>

#include <cstdio>

#include <algorithm>

#include <cstring>

using namespace std;

struct sdsd

{

    int from,to,value,time;

};

bool operator < (sdsd a,sdsd b)

{

    return a.time>b.time;

}

sdsd zz[45555];

int sb[15555],sc[15555],svalue[15555],stime1[155555],sd[15555];

int main ()

{

    //freopen ("data.in","r",stdin);

    int n,m;

    while (cin >>n>>m)

    {

        if (!n) break;

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

        {

            svalue[i]=1e9+1;

            stime1[i]=1e9+1;

        }

        svalue[1]=0;

        stime1[1]=0;

        memset (sc,0,sizeof(sc));

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

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

        memset (sd,0,sizeof(sd));

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

        {

            int a,b,c,d;

            scanf ("%d%d%d%d",&a,&b,&c,&d);

            zz[2*i].to=a;

            zz[2*i].from=sb[b];

            sb[b]=2*i;

            zz[2*i].value=d;

            zz[2*i].time=c;

            zz[2*i+1].to=b;

            zz[2*i+1].from=sb[a];

            sb[a]=2*i+1;

            zz[2*i+1].value=d;

            zz[2*i+1].time=c;

        }

        priority_queue <int > se;

        int x=sb[1];

        while (x!=-1)

        {

            if (stime1[1]+zz[x].time<stime1[zz[x].to])

            {

                stime1[zz[x].to]=stime1[1]+zz[x].time;

                svalue[zz[x].to]=zz[x].value;

                sd[zz[x].to]=1;

                if (!sc[zz[x].to])

                {

                    se.push(zz[x].to);

                    sc[zz[x].to]=1;

                }

            }

            else if (stime1[1]+zz[x].time==stime1[zz[x].to])

            {

                if (zz[x].value<svalue[zz[x].to])

                {

                    svalue[zz[x].to]=zz[x].value;

                    sd[zz[x].to]=1;

                    if (!sc[zz[x].to])

                    {

                        se.push(zz[x].to);

                        sc[zz[x].to]=1;

                    }

                }

            }

            x=zz[x].from;

        }

        while (!se.empty())

        {

            int tt=se.top();

            se.pop();

            sc[tt]=0;

            int t=sb[tt];

        while (t!=-1)

        {

            if (stime1[tt]+zz[t].time<stime1[zz[t].to])

            {

                stime1[zz[t].to]=stime1[tt]+zz[t].time;

                svalue[zz[t].to]=zz[t].value;

                sd[zz[t].to]=tt;

                //cout <<zz[x].to<<" "<<sd[zz[x].to]<<endl;

                if (!sc[zz[t].to])

                {

                    se.push(zz[t].to);

                    sc[zz[t].to]=1;

                }

            }

            else if (stime1[tt]+zz[t].time==stime1[zz[t].to])

            {

            /*cout <<tt<<" "<<zz[t].to<<endl;

            cout<<svalue[tt]<<" "<< zz[t].value<<" "<<svalue[zz[t].to]<<endl;

            cout <<endl;*/

                if (zz[t].value<svalue[zz[t].to])

                {

                    svalue[zz[t].to]=zz[t].value;

                    sd[zz[t].to]=tt;

                    if (!sc[zz[t].to])

                    {

                        se.push(zz[t].to);

                        sc[zz[t].to]=1;

                    }

                }

            }

            t=zz[t].from;

        }



        }

        int s=0;

        for (int i=2;i<=n;i++)

        {

            s+=svalue[i];

        }

        cout <<s<<endl;

    }

}




// Optimized solution to the same problem (faster):
//#include<bits/stdc++.h>

#define _CRT_SBCURE_NO_DEPRECATE

#include <set>

#include <map>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <functional>

//#define UP(i,x,y) for(int i=x;i<=y;i++)

//#define DOWN(i,x,y) for(int i=x;i>=y;i--)

#define sdddd(x,y,z,k) scanf("%d%d%d%d", &x, &y, &z, &k)

#define sddd(x,y,z) scanf("%d%d%d", &x, &y, &z)

#define sdd(x,y) scanf("%d%d", &x, &y)

#define sd(x) scanf("%d", &x)

#define mp make_pair

#define pb push_back

#define lson k<<1

#define rson k<<1|1

#define mid (l+r)/2

#define ms(x, y) memset(x, y, sizeof x)

using namespace std;

typedef long long ll;

//typedef unsigned long long ull;

#define MOD 142857

const int maxn = 10100;

const int INF = 0x3f3f3f3f;

const ll LINF = 0x3f3f3f3f3f3f3f3f;

int n, m, s, t;

int len;

struct road

{

	int u, v, len, cost;

	int next;

};

struct node

{

    int v;

    int len;

    int cost;

    node(int v, int l, int c):v(v),len(l),cost(c){}

    friend bool operator <(node a, node b)

    {

        return a.len>b.len;

    }

};

road G[maxn*5];

int h[maxn];

int mx = -INF;

int d[maxn];

int c[maxn];

int path[maxn];

void dij()

{

    fill(d, d+n+1, INF);

    fill(path, path+n+1, -1);

    fill(c, c+n+1, 0);

    d[1] = 0;

    priority_queue<node> pque;

    pque.push(node(1, 0, 0));

    while(pque.size())

    {

        node p = pque.top(); pque.pop();

        int v = p.v;

        if(d[v] < p.len) continue;

        for(int i = h[v]; i != -1; i = G[i].next)

        {

            road e = G[i];

            if(d[e.v] > d[e.u] + e.len)

            {

                d[e.v] = d[e.u] + e.len;

                c[e.v] = c[e.u] + e.cost;

                path[e.v] = i;

                pque.push(node(e.v, d[e.v], c[e.v]));

            }

            else if(d[e.v] == d[e.u] + e.len)

            {

                if(path[e.v] != -1 && G[path[e.v]].cost > e.cost)

                {

                    path[e.v] = i;

                    pque.push(node(e.v, d[e.v], c[e.v]));

                }

            }

        }

    }

}

int main()

{

	//freopen("out.txt", "w", stdout);

    while(~sdd(n, m) && (n||m))

    {

        int ta, tb, tc, td;

        int len = 0;

        fill(h, h+n+1, -1);

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

        {

            sdddd(ta, tb, tc, td);

            G[len].u = ta;

            G[len].v = tb;

            G[len].len = tc;

            G[len].cost = td;

            G[len].next = h[ta];

            h[ta] = len++;



            G[len].u = tb;

            G[len].v = ta;

            G[len].len = tc;

            G[len].cost = td;

            G[len].next = h[tb];

            h[tb] = len++;

        }

        dij();

        int ans = 0;

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

        {

            if(path[i]!=-1)

            {

                ans += G[path[i]].cost;

            }

        }

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

    }



	return 0;

}




// Fastest known solution for this problem: