#include<fstream>
#include<vector>
#include<cmath>
using namespace std;

const double ep=1e-6;
double a[300][300],p;
vector <int> b[300];
int i,n,m,j,k,x,y,z,c[300][300];

void sw(int x,int y)
{
	int i;
	for (i=1;i<=n;i++)
		swap(a[x][i],a[y][i]);
}

int main()
{
	ifstream f("tunel.in");
	ofstream g("tunel.out");
	f >> n >> m;
	for (i=1;i<=m;i++)
	{
		f >> x >> y >> z;
		if (c[x][y]==0)
		{
			b[x].push_back(y);
			b[y].push_back(x);
			c[x][y]=z;c[y][x]=z;
		}
		else c[x][y]=min(c[x][y],z);
	}
	a[n][n]=1;
	for (i=1;i<n;i++)
	{
		a[i][i]=b[i].size();
		for (j=0;j<b[i].size();j++)
		{
			a[i][b[i][j]]=-1;
			a[i][n+1]+=c[i][b[i][j]];
		}
	}
	for (i=1;i<=n;i++)
	{
		if (fabs(a[i][i])<ep)
			for (j=i+1;j<=n;j++)
				if (fabs(a[j][i])>ep)
				{
					sw(i,j);
					break;
				}
		for (j=1;j<=n;j++)
			if (i!=j)
			{
				p=a[j][i]/a[i][i];
				for (k=1;k<=n+1;k++)
					a[j][k]-=a[i][k]*p;
			}
	}
	g << a[1][n+1];
	return 0;
}