#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1 << 9, M = 1 << 16;
const ll inf = 1e18;
int n;
ll apsp[N][N], sssp[N];
int a[M], b[M], w[M], c[M];
vector<int> adj[N];
bool vis[N];
ll dijkstra(int s, int t) {
fill(sssp, sssp + n + 1, inf);
fill(vis, vis + n, false);
sssp[s] = 0;
for (int i = 0; i < n; ++i) {
int u = n;
for (int v = 0; v < n; ++v) if (!vis[v] && sssp[v] < sssp[u]) u = v;
vis[u] = true;
if (sssp[u] == inf) break;
for (int e : adj[u]) sssp[b[e]] = min(sssp[b[e]], sssp[u] + w[e]);
}
return sssp[t];
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int m;
cin >> n >> m;
for (int u = 0; u < n; ++u) for (int v = 0; v < n; ++v) apsp[u][v] = inf;
for (int u = 0; u < n; ++u) apsp[u][u] = 0;
for (int e = 0; e < m; ++e) {
cin >> a[e] >> b[e] >> w[e] >> c[e];
--a[e];
--b[e];
apsp[a[e]][b[e]] = min(apsp[a[e]][b[e]], (ll)w[e]);
adj[a[e]].push_back(e);
}
for (int w = 0; w < n; ++w) for (int u = 0; u < n; ++u) for (int v = 0; v < n; ++v) apsp[u][v] = min(apsp[u][v], apsp[u][w] + apsp[w][v]);
int s = 0, t = n - 1;
ll ans = apsp[s][t] + apsp[t][s];
for (int e = 0; e < m; ++e) {
ll to = min(apsp[s][t], apsp[s][b[e]] + w[e] + apsp[a[e]][t]),
fr = min(apsp[t][s], apsp[t][b[e]] + w[e] + apsp[a[e]][s]);
if (c[e] + to + fr < ans) {
adj[a[e]].erase(find(adj[a[e]].begin(), adj[a[e]].end(), e));
swap(a[e], b[e]);
adj[a[e]].push_back(e);
ans = min(ans, c[e] + dijkstra(s, t) + dijkstra(t, s));
adj[a[e]].pop_back();
swap(a[e], b[e]);
adj[a[e]].push_back(e);
}
}
cout << (ans < inf ? ans : -1);
}
