#include<bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0;i<(n);i++)

const int xN = 100000;

template<class T>
using nega_queue = priority_queue<T,vector<T>,greater<T>>;

struct Edge{ int u,v,r; LL c; LL d; };

int N;
int fSrc=0;
int fSnk=1;
vector<Edge> J;
vector<int> E[xN];

LL F;
LL fAns = 0;
LL fD[xN];
int fPE[xN];
LL fP[xN]={};

void addEdge(int u,int v,LL c,LL d){
 E[u].push_back(J.size());
 J.push_back({u,v,(int)J.size()+1,c,d});
 E[v].push_back(J.size());
 J.push_back({v,u,(int)J.size()-1,0,-d});
}

void fDijkstra(){
 rep(i,N) fD[i]=fPE[i]=-1;
 nega_queue<pair<LL,pair<int,int>>> Q; Q.push({0,{fSrc,-1}});
 while(Q.size()){
  LL d=Q.top().first;
  int p=Q.top().second.first;
  int pre=Q.top().second.second;
  Q.pop();
  if(fD[p]!=-1) continue;
  fD[p]=d;
  fPE[p]=pre;
  for(int j:E[p]){
   if(J[j].c==0)continue;
   Q.push({d+J[j].d+fP[p]-fP[J[j].v],{J[j].v,j}});
  }
 }
 rep(i,N) fP[i]+=fD[i];
}

void flow(){
 fDijkstra();
 if(fD[fSnk]==-1){ F=0; fAns=-1; return; }
 int p=fSnk;
 LL c=F;
 while(p!=fSrc){
  c=min(c,J[fPE[p]].c);
  p=J[fPE[p]].u;
 }
 p=fSnk;
 while(p!=fSrc){
  J[fPE[p]].c-=c;
  J[J[fPE[p]].r].c+=c;
  fAns += c * J[fPE[p]].d;
  p=J[fPE[p]].u;
 }
 F-=c;
}

int M;

int main(){
  cin>>N>>M;
  rep(i,M){
    int u,v,c,d; cin>>u>>v>>c>>d; u--; v--;
    addEdge(u,v,1,c); addEdge(u,v,1,d);
    addEdge(v,u,1,c); addEdge(v,u,1,d);
  }

  fSrc=0; fSnk=N-1;

  F=2;
  while(F) flow();
  cout<<fAns<<endl;
  
  return 0;
}