#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 200 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
vector<array<ll,3>> adj[N];
void solve(int test_case)
{
ll n,m; cin >> n >> m;
vector<array<ll,4>> edges(m+5);
rep1(i,m){
ll u,v,w,d; cin >> u >> v >> w >> d;
adj[u].pb({v,w,i}), adj[v].pb({u,w,i});
edges[i] = {u,v,w,d};
}
auto dijkstra = [&](ll s, ll flipped){
vector<ll> dis(n+5,inf2);
vector<bool> vis(n+5);
dis[s] = 0;
rep1(iter,n){
pll best = {inf2,inf2};
rep1(u,n){
if(vis[u]) conts;
pll px = {dis[u],u};
amin(best,px);
}
ll u = best.ss;
vis[u] = 1;
for(auto [v,w,id] : adj[u]){
if(id != flipped){
if(edges[id][0] == u){
amin(dis[v],dis[u]+w);
}
}
else{
if(edges[id][0] == v){
amin(dis[v],dis[u]+w);
}
}
}
}
return dis;
};
ll ans = inf2;
amin(ans,dijkstra(1,-1)[n]+dijkstra(n,-1)[1]);
rep1(i,m){
ll cost = edges[i][3]+dijkstra(1,i)[n]+dijkstra(n,i)[1];
amin(ans,cost);
}
if(ans == inf2) ans = -1;
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
