#include <iostream>
#include <atcoder/mincostflow>

using namespace std;
using namespace atcoder;
typedef long long ll;
int main(){
    int i,n,m; cin >> n >> m;
    mcf_graph<ll,ll> g(n + 4*m);
    int now = n;
    for(i=0;i<m;i++){
        int u,v,c,d; cin >> u >> v >> c >> d; u--; v--;
        g.add_edge(u,now,1,c); g.add_edge(now + 1,v,1,c);
        g.add_edge(v,now,1,c); g.add_edge(now + 1,u,1,c);
        g.add_edge(now,now + 1,1,0);
        g.add_edge(u,now + 2,1,d); g.add_edge(now + 3,v,1,d);
        g.add_edge(v,now + 2,1,d); g.add_edge(now + 3,u,1,d);
        g.add_edge(now + 2,now + 3,1,0);
        now += 4;
    }
    auto ret = g.flow(0,n - 1,2);
    cout << ret.second/2 << endl;
    //cout << ret.first << " " << ret.second << endl;
    //cout << g.flow(0,n - 1,2).second << endl;
}