#include <bits/stdc++.h>
using namespace std;
const int maxm = 5000 + 15;
const int maxn = 100 + 15;
const double eps = 1e-9;
int n, m;
int x[maxm], y[maxm], z[maxm];
int f[maxn][maxn];
int row, col;
double mat[maxn][maxn];
double height[maxn];
int gauss() {
  for (int r = 1, c = 1; r <= row && c < col; r++, c++) {
    int maxx = r;
    for (int i = r + 1; i <= row; i++)
      if (abs(mat[i][c]) > abs(mat[maxx][c])) maxx = i;
    if (abs(mat[maxx][c]) < eps) {
      r--;
      continue;
    }
    for (int i = 1; i <= col; i++) swap(mat[r][i], mat[maxx][i]);
    for (int i = 1; i <= row; i++)
      if (i != r) {
        double maxx = mat[i][c] / mat[r][c];
        for (int j = 1; j <= col; j++) mat[i][j] -= maxx * mat[r][j];
      }
  }
  height[n] = 1;
  for (int i = 1; i <= row; i++) {
    int ind = 0;
    for (ind = 1; ind < col && abs(mat[i][ind]) < eps; ind++)
      ;
    if (ind == col) continue;
    height[ind + 1] = mat[i][col] / mat[i][ind];
  }
  return 0;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d%d", &x[i], &y[i], &z[i]);
    f[x[i]][y[i]]++;
    f[y[i]][x[i]]++;
  }
  row = n - 2;
  col = n - 1;
  for (int i = 2; i < n; i++)
    for (int j = 1; j <= n; j++) {
      mat[i - 1][i - 1] -= f[i][j];
      if (j > 1 && j < n) mat[i - 1][j - 1] += f[i][j];
      if (j == n) mat[i - 1][col] -= f[i][j];
    }
  gauss();
  double bs = 1e9, outt = 0;
  for (int i = 1; i <= m; i++) {
    bs = min(bs, z[i] / abs(height[y[i]] - height[x[i]]));
    if (x[i] == 1 || y[i] == 1) outt += abs(height[y[i]] - height[x[i]]);
  }
  printf("%.10lf\n", outt * bs);
  for (int i = 1; i <= n; i++) height[i] *= bs;
  for (int i = 1; i <= m; i++) printf("%.10lf\n", height[y[i]] - height[x[i]]);
  return 0;
}
