#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
int INF=0x3f3f3f3f;
bool at[10000][10000];
struct point
{
	int nt;
	int ntat;
}t;
vector<point>p[10000];

void dfs(int k,int x,int sum)
{
	int i,nt,ntat;
	if(x==1 && k!=0)
	{
		if(INF>sum)INF=sum;
		return;
	}
	for(i=0;i<p[x].size();i++)
	{
		nt=p[x][i].nt;
		ntat=p[x][i].ntat;
		if(!at[x][nt]  && !at[nt][x])
		{
			at[x][nt]=1;
			at[nt][x]=1;
			dfs(x,nt,sum+ntat);
			at[x][nt]=0;
			at[nt][x]=0;
		}
	}
}
int main()
{
	freopen("both.in","r",stdin);
	freopen("both.out","w",stdout);
	int n,m;
	int x,y,tmp,tmp2,i;
	scanf("%d %d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d%d",&x,&y,&tmp,&tmp2);
		t.nt=y;
		t.ntat=tmp;
		p[x].push_back(t);
		t.nt=x;
		t.ntat=tmp2;
		p[y].push_back(t);
	}
	dfs(0,1,0);
	if(INF==0x3f3f3f3f)
	{
		printf("-1");
		return 0;
	}
	printf("%d",INF);
	return 0;
}