#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
int n,m;
const int _maxn=40010;
int head[_maxn];
bool vis[_maxn];
struct e
{
	int to,dis,Next;
}a[_maxn*3];
int k=0;
void add(int x,int y,int dis)
{
	a[++k].to=y;
	a[k].dis=dis;
	a[k].Next=head[x];
	head[x]=k;
}
void read()
{
	int x,y,d1,d2;
	memset(head,-1,sizeof(head));
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%d%d",&x,&y,&d1,&d2);
		add(x,y,d1);
		add(y,x,d2);
	}
}
int ans=0x7fffffff;
void dfs(int x,int sum,int root)
{
	if(x==1 && root!=-1)
	{
		if(sum<ans)
			ans=sum;
		return;
	}
	for(int i=head[x];i!=-1;i=a[i].Next)
	{
		if(!vis[a[i].to] && a[i].to!=root)
		{
			vis[a[i].to]=true;
			dfs(a[i].to,sum+a[i].dis,x);
			vis[a[i].to]=false;
		}
	}
}
void solve()
{
	dfs(1,0,-1);
	if(ans!=0x7fffffff)
		cout<<ans<<endl;
	else
		cout<<-1<<endl;
}
int main()
{
	freopen("both.in","r",stdin);
	freopen("both.out","w",stdout);
	read();
	solve();
	return 0;
}