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

#include <stdio.h>

#include <string.h>

#include <queue>

using namespace std;

const int maxn=10050,maxm=20050,inf=0x3f3f3f3f;

struct Edge

{

    int to,next,dis,cos ;

}edge[maxm*2];

struct Pair

{

    int D,V,C;

    Pair(){;}

    Pair(int d,int c,int v)

    {

        D=d,V=v,C=c;

    }

    friend bool operator <(const Pair a,const Pair b)

    {

        if(a.D!=b.D)

        return a.D>b.D;

        else return a.C>b.C;

    }

};

int tot,head[maxn],dist[maxn],cost[maxn];

bool vis[maxn];

void init()

{

    tot=0;

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

}

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

{

    edge[tot].to=v;

    edge[tot].dis=d;

    edge[tot].cos=c;

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

    head[u]=tot++;

}

int dijstra(int start)

{

    memset(vis,false,sizeof(vis));

    memset(dist,inf,sizeof(dist));

    int ans=0;

    dist[start]=0;

   // vis[start]=true;

    priority_queue<Pair>que;

    que.push(Pair(0,0,start));

    while(!que.empty())

    {

        Pair now=que.top();

        que.pop();

        if(vis[now.V])

            continue;

        vis[now.V]=true;

        ans+=now.C;

        for(int i=head[now.V];i!=-1;i=edge[i].next)

        {

            int to=edge[i].to;

            que.push(Pair(now.D+edge[i].dis,edge[i].cos,to));

        }

    }

    return ans;

}

int main()

{

    int u,v,d,c;

    int n,m;

    while(scanf("%d%d",&n,&m)!=-1)

    {

        init();

        if(n==0&&m==0)break;

        for(int 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);

        }

        printf("%d\n",dijstra(1));

    }

    return 0;

}

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

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <queue>

using namespace std;



#define MAXN 20005

#define MAXE 40005

#define INF 0x3f3f3f3f



typedef int Type;



class Dijkstra

{

public:

    int head[MAXN],nxt[MAXE],cnt;

    Type d[MAXN];

    struct Edge

    {

        int v;

        Type dis;

        Type cost;

        Edge() {}

        Edge(int v,Type dis,Type cost):v(v),dis(dis),cost(cost) {}

        bool operator<(const Edge& ed) const

        {

            return dis>ed.dis;

        }

    } e[MAXE];

    bool vis[MAXN];



    //初始化，n?点数

    void init(int n)

    {

        cnt = 0;

        for(int i = 0; i<=n; i++) head[i] = -1;

    }



    inline void addEdge(int u,int v,Type dis,Type cost)

    {

        e[cnt] = Edge(v,dis,cost);

        int tmp = head[u];

        head[u] = cnt;

        nxt[cnt++] = tmp;

    }



    void dijkstra(int s,int t,int n)

    {

        for(int i = 0; i<=n; i++) d[i] = INF,vis[i] = false;

        d[s] = 0;

        priority_queue<Edge> q;

        q.push(Edge(s,0,0));

        while(!q.empty())

        {

            Edge ed = q.top();

            q.pop();

            vis[ed.v] = true;

            for(int i = head[ed.v]; ~i; i = nxt[i])

            {

                Edge ee = e[i];

                if(!vis[ee.v]&&d[ee.v]>d[ed.v]+ee.dis)

                {

                    d[ee.v] = d[ed.v]+ee.dis;

                    /*

                     *  最短路?

                    	p[ee.v] = MP(u,i);

                    */

                    q.push(Edge(ee.v,d[ee.v],ee.cost));

                }

            }

        }

    }



    void buildGraph(int m)

    {

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

        {

            int u,v,d,c;

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

            addEdge(u,v,d,c);

            addEdge(v,u,d,c);

        }

    }



    Type getMinCost(int n)

    {

        int ans=0;

        for(int u=2; u<=n; u++) //首都不能?

        {

            int Min=INF;

            for(int j=head[u]; ~j; j=nxt[j])

            {

                Edge ee = e[j];

                if(d[u]==d[ee.v]+ee.dis && ee.cost<Min) //找??足?先距?最短，然后?用最低的那个最低?用

                    Min=ee.cost;

            }

            ans+=Min;

        }

        return ans;

    }

} dij;



int main()

{

    int n,m;

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

    {

        if(n==0 && m==0)

            break;

        dij.init(n);

        dij.buildGraph(m);

        dij.dijkstra(1,n,n);

        int ans=dij.getMinCost(n);

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

    }

    return 0;

}