#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
int dy[8] = {0,-1,0,1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
//const int mod = 1e9 + 7;
const int mod = 998244353;

struct mcf{
	struct edge{
		ll to, cap, cost, rev;
	};
	int n;
	vector<vector<edge>> G;
	vector<ll> dist,prevv,preve;

	mcf(int n) : n(n) {
		G.resize(n);
		dist.resize(n);
		prevv.resize(n);
		preve.resize(n);
	}

	void add_edge(ll from, ll to, ll cap, ll cost){
		G[from].push_back(edge{to, cap, cost, (ll)G[to].size()});
		G[to].push_back(edge{from, 0, -cost, (ll)G[from].size()-1});
	}

	ll flow(ll s, ll t, ll f){
		ll res = 0;
		while(f > 0){
			fill(dist.begin(), dist.end(), linf);
			dist[s] = 0;
			bool upd = true;
			while(upd){
				upd = false;
				for(int u=0; u<n; u++){
					if(dist[u] == linf) continue;
					for(int i=0; i<G[u].size(); i++){
						edge &e = G[u][i];
						if(e.cap > 0 && dist[e.to] > dist[u] + e.cost){
							dist[e.to] = dist[u] + e.cost;
							prevv[e.to] = u;
							preve[e.to] = i;
							upd = true;
						}
					}
				}
			}

			if(dist[t] == linf) return -1;

			ll d = f;
			for(int u=t; u!=s; u=prevv[u]){
				d = min(d, G[prevv[u]][preve[u]].cap);
			}
			f -= d;
			res += d * dist[t];
			for(int u=t; u!=s; u=prevv[u]){
				edge &e = G[prevv[u]][preve[u]];
				e.cap -= d;
				G[u][e.rev].cap += d;
			}
		}
		return res;
	}
};

int main(){
	ll n,m; cin >> n >> m;
	mcf G(n);
	rep(i,m){
		ll u,v,c,d; cin >> u >> v >> c >> d; u--; v--;
		G.add_edge(u,v,1,c);
		G.add_edge(u,v,1,d);
		G.add_edge(v,u,1,c);
		G.add_edge(v,u,1,d);
	}
	ll ans = G.flow(0,n-1,2);
	cout << ans << "\n";
}