#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
using ll = long long;
template<class T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
const int N = 1 << 9, M = 1 << 16;
const ll inf = 1e18;
int n;
ll d[N][N], dist[N];
int a[M], b[M], w[M], c[M];
vector<int> g[N];
bool vis[N];
ll dij(int s, int t) {
fill(dist, dist + n + 1, inf);
fill(vis, vis + n, false);
dist[s] = 0;
rep(i, 0, n) {
int u = n;
rep(v, 0, n) if (!vis[v] && dist[v] < dist[u]) u = v;
vis[u] = true;
if (dist[u] == inf) break;
for (int e : g[u]) ckmin(dist[b[e]], dist[u] + w[e]);
}
return dist[t];
}
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int m; cin >> n >> m;
rep(u, 0, n) rep(v, 0, n) d[u][v] = inf;
rep(u, 0, n) d[u][u] = 0;
rep(e, 0, m) {
cin >> a[e] >> b[e] >> w[e] >> c[e], --a[e], --b[e];
ckmin(d[a[e]][b[e]], ll(w[e]));
g[a[e]].push_back(e);
}
rep(w, 0, n) rep(u, 0, n) rep(v, 0, n) ckmin(d[u][v], d[u][w] + d[w][v]);
int s = 0, t = n - 1;
ll ans = d[s][t] + d[t][s];
vector<bool> is(m);
vector<int> par(n, -1);
for(int i = 0; i < m; ++i){
int x = a[i];
int y = b[i];
if(par[x] == -1){
if(d[0][y] == d[0][x] + w[i]){
par[x] = y;
is[i] = 1;
}
}
}
vector<int> par2(n, -1);
for(int i = 0; i < m; ++i){
int x = a[i];
int y = b[i];
if(par2[x] == -1){
if(d[n-1][y] == d[n-1][x] + w[i]){
par2[x] = y;
is[i] = 1;
}
}
}
rep(e, 0, m) {
ll to = min(d[s][t], d[s][b[e]] + w[e] + d[a[e]][t]);
ll fr = min(d[t][s], d[t][b[e]] + w[e] + d[a[e]][s]);
if(!is[e]){
if(to + fr + c[e] < ans){
ans = min(ans, to + fr + c[e]);
}
}
if (c[e] + to + fr < ans) {
g[a[e]].erase(find(all(g[a[e]]), e)); swap(a[e], b[e]); g[a[e]].push_back(e);
ckmin(ans, c[e] + dij(s, t) + dij(t, s));
g[a[e]].pop_back(); swap(a[e], b[e]); g[a[e]].push_back(e);
}
}
cout << (ans < inf ? ans : -1);
}
