1
#include<bits/stdc++.h>
2

3
using namespace std;
4
int n, m;
5
const int N = 110;
6
int dis[N][N];
7
long long cnt[N][N];
8
int main()
9
{
10
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
11
  cin >> n >> m;
12
  memset(dis, 0x3f, sizeof dis);
13
  for(int i = 1;i <= n;i++)
14
    dis[i][i] = 0, cnt[i][i] = 1;
15
  for(int i = 1, a, b, c;i <= m;i++)
16
    cin >> a >> b >> c, dis[a][b] = dis[b][a] = c, cnt[a][b] = cnt[b][a] = 1;
17

18
  for(int k = 1;k <= n;k++)
19
  {
20
    for(int i = 1;i <= n;i++)
21
    {
22
      for(int j = 1;j <= n;j++)
23
      {
24
        if(i == j || i == k || j == k) continue;
25
        if(dis[i][k] + dis[k][j] < dis[i][j])
26
        {
27
          dis[i][j] = dis[i][k] + dis[k][j];
28
          cnt[i][j] = 0;
29
        }
30
        if(dis[i][k] + dis[k][j] == dis[i][j])
31
        {
32
          cnt[i][j] += cnt[i][k] * cnt[k][j];
33
        }
34
      }
35
    }
36
  }
37
  for(int k = 1;k <= n;k++)
38
  {
39
    double ans = 0;
40
    for(int s = 1;s <= n;s++)
41
    {
42
      for(int t = 1;t <= n;t++)
43
      {
44
        if(s == k || t == k) continue;
45
        if(dis[s][k] + dis[k][t] == dis[s][t])
46
        {
47
          ans += cnt[s][k] * cnt[k][t] * 1.0 / cnt[s][t];
48
        }
49
      }
50

51
    }
52
    printf("%.3lf\n", ans);
53
  }
54

55
  return 0;
56
}