#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
typedef long long int LL;
const LL MAXSIZE = 502;
const LL INF = 0x3f3f3f3f;
LL s_road[MAXSIZE][MAXSIZE];
LL b_road[MAXSIZE][MAXSIZE];
LL s_dis[MAXSIZE];
LL b_dis[MAXSIZE];
int n, m;
void dealwith_sroad() {
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (s_road[i][j] > s_road[i][k] + s_road[k][j])
s_road[i][j] = s_road[i][k] + s_road[k][j];
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
s_road[i][j] = s_road[i][j] * s_road[i][j];
}
}
}
struct Node {
bool big;
int u;
LL d;
} beg, in, out;
LL Dijkstra() {
queue<Node> Q;
beg.big = 1;
beg.u = 1;
beg.d = 0;
for (int i = 1; i <= n; i++)
s_dis[i] = b_dis[i] = (i == 1 ? 0 : INF);
Q.push(beg);
while (!Q.empty()) {
out = Q.front();
Q.pop();
LL u = out.u, d = out.d;
for (int i = 1; i <= n; i++) {
if (out.big) {
in.big = 0;
in.u = i;
in.d = s_road[u][i] + d;
if (in.d <= s_dis[i]) {
s_dis[i] = in.d;
Q.push(in);
}
}
in.big = 1;
in.u = i;
in.d = b_road[u][i] + d;
if (in.d <= b_dis[i]) {
b_dis[i] = in.d;
Q.push(in);
}
}
}
}
int main() {
cin >> n >> m;
memset(s_road, INF, sizeof(s_road));
memset(b_road, INF, sizeof(b_road));
int t, a, b, c;
for (int i = 0; i < m; ++i) {
cin >> t >> a >> b >> c;
if (t == 1)
s_road[a][b] = s_road[b][a] = min(LL(c), s_road[a][b]);
else
b_road[a][b] = b_road[b][a] = min(LL(c), b_road[a][b]);
}
dealwith_sroad();
Dijkstra();
LL res = min(s_dis[n], b_dis[n]);
cout << res << endl;
}
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
typedef long long int LL;
const LL MAXSIZE = 502;
const LL INF = 0x3f3f3f3f;
LL s_road[MAXSIZE][MAXSIZE];
LL b_road[MAXSIZE][MAXSIZE];
LL s_dis[MAXSIZE];
LL b_dis[MAXSIZE];
int n, m;
void dealwith_sroad() {
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (s_road[i][j] > s_road[i][k] + s_road[k][j])
s_road[i][j] = s_road[i][k] + s_road[k][j];
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
s_road[i][j] = s_road[i][j] * s_road[i][j];
}
}
}
struct Node {
bool big;
int u;
} beg, in, out;
LL Dijkstra() {
queue<Node> Q;
beg.big = 1;
beg.u = 1;
for (int i = 1; i <= n; i++)
s_dis[i] = b_dis[i] = (i == 1 ? 0 : INF);
Q.push(beg);
while (!Q.empty()) {
out = Q.front();
Q.pop();
int u = out.u;
for (int i = 1; i <= n; i++) {
if (u == i) continue;
if (out.big) {
in.big = 0;
in.u = i;
if (s_dis[i]>b_dis[u]+s_road[u][i]){
s_dis[i] = b_dis[u]+s_road[u][i];
Q.push(in);
}
in.big = 1;
if (b_dis[i]>b_dis[u]+b_road[u][i]){
b_dis[i] = b_dis[u]+b_road[u][i];
Q.push(in);
}
} else{
in.big = 1;
in.u = i;
if (b_dis[i]>s_dis[u]+b_road[u][i]){
b_dis[i] = s_dis[u]+b_road[u][i];
Q.push(in);
}
}
}
}
}
int main() {
cin >> n >> m;
memset(s_road, INF, sizeof(s_road));
memset(b_road, INF, sizeof(b_road));
int t, a, b, c;
for (int i = 0; i < m; ++i) {
cin >> t >> a >> b >> c;
if (t == 1)
s_road[a][b] = s_road[b][a] = min(LL(c), s_road[a][b]);
else
b_road[a][b] = b_road[b][a] = min(LL(c), b_road[a][b]);
}
dealwith_sroad();
Dijkstra();
LL res = min(s_dis[n], b_dis[n]);
cout << res << endl;
}