#include <bits/stdc++.h>
using namespace std;
const int inf = 0x20202020;
const int mod = 1000000007;
template <class T>
inline void read(T& x) {
  bool fu = 0;
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x);
  read(y);
  read(z);
}
template <class T>
inline void read(T& x, T& y, T& z, T& q) {
  read(x);
  read(y);
  read(z);
  read(q);
}
const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1};
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 111, M = 111111;
int l, m, n, t, C, x, y, z;
double v[N][N];
struct zcc {
  int x, y, z;
} a[M];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = (1); i <= (m); ++i) {
    scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].z);
    v[a[i].x][a[i].x]--;
    v[a[i].x][a[i].y]++;
    v[a[i].y][a[i].y]--;
    v[a[i].y][a[i].x]++;
  }
  for (int i = (1); i <= (n); ++i) v[1][i] = v[n][i] = 0;
  v[1][n + 1] = 1;
  v[1][1] = v[n][n] = 1;
  for (int i = (1); i <= (n); ++i) {
    for (int j = (i + 1); j <= (n); ++j)
      if (abs(v[j][i]) > abs(v[i][i])) {
        for (int k = (i); k <= (n + 1); ++k) swap(v[i][k], v[j][k]);
      }
    if (v[i][i] == 0) continue;
    for (int j = (i + 1); j <= (n); ++j) {
      for (int k = (i + 1); k <= (n + 1); ++k)
        v[j][k] -= v[j][i] / v[i][i] * v[i][k];
      v[j][i] = 0;
    }
  }
  for (int i = (n); i >= (1); --i) {
    for (int j = (i + 1); j <= (n); ++j)
      v[i][n + 1] -= v[i][j] * v[j][n + 1], v[i][j] = 0;
    if (v[i][i] == 0)
      v[i][n + 1] = 0;
    else
      v[i][n + 1] /= v[i][i];
  }
  double ans = 1e30;
  for (int i = (1); i <= (m); ++i)
    ans = min(ans, abs(1.0 * a[i].z / (v[a[i].x][n + 1] - v[a[i].y][n + 1])));
  double res = 0;
  for (int i = (1); i <= (m); ++i)
    if (a[i].x == 1)
      res += ans * (v[a[i].x][n + 1] - v[a[i].y][n + 1]);
    else if (a[i].y == 1)
      res += ans * (v[a[i].y][n + 1] - v[a[i].x][n + 1]);
  printf("%.9lf\n", res);
  for (int i = (1); i <= (m); ++i)
    printf("%.9lf\n", ans * (v[a[i].x][n + 1] - v[a[i].y][n + 1]));
  return 0;
}
