#include<cstdio>

using namespace std;

int N, M, a[5009], b[5009], c[5009], ap[109][109], cnt[109], fixed[109];
double mini, G[109][109], X[109], eps;

double mod (double x)
{
    if (x < 0.0) return -x;
    return x;
}

int main ()
{
freopen ("flux.in", "r", stdin);
freopen ("flux.out", "w", stdout);

scanf ("%d %d", &N, &M), eps = 1e-7;
for (int i=1; i<=M; i++)
{
    scanf ("%d %d %d", &a[i], &b[i], &c[i]), cnt[a[i]] ++, cnt[b[i]] ++, ap[a[i]][b[i]] ++, ap[b[i]][a[i]] ++;
    if (a[i] == b[i])
    {
        printf ("cam de rahat cu cazuri particulare, nu?");
        while (1) c[i] ++;
    }
}
///pentru un j suma (i, j) = 0 unde (i, j) = Xj - Xi
for (int i=1; i<=N; i++)
{
    if (i == 1) G[i][1] = 1.0, G[i][N + 1] = 0.0;
    else
    {
        G[i][i] = cnt[i];
        for (int j=1; j<=N; j++)
            if (i != j) G[i][j] = (double)-ap[i][j];
        G[i][N + 1] = 0.0;
        if (i == N) G[i][N + 1] = 1.0;
    }
}

for (int i=1; i<=N; i++)
{
    int j;
    for (j=1; j<=N; j++)
        if (mod (G[i][j]) > eps) break;
    fixed[i] = j;
    for (int p=1; p<=N; p++)
        if (p != i && mod (G[p][j]) > eps)
        {
            double r = (double) G[p][j] / G[i][j];
            for (int k=1; k<=N + 1; k++)
                G[p][k] = (double) G[p][k] - G[i][k] * r;
        }
}

for (int i=1; i<=N; i++)
    X[fixed[i]] = (double) G[i][N + 1] / G[i][fixed[i]];

for (int i=1; i<=M; i++)
{
    double C = X[b[i]] - X[a[i]];
    if (((double) c[i] / C < mini || i == 1) && C > eps)
        mini = (double) c[i] / C;
}
printf ("%.10lf\n", mini);

return 0;
}