# include <cstdio>

# include <cstring>

# include <cstdlib>

# include <iostream>

# include <vector>

# include <queue>

# include <stack>

# include <map>

# include <set>

# include <cmath>

# include <algorithm>

using namespace std;

# define lowbit(x) ((x)&(-x))

# define pi 3.1415926535

# define eps 1e-

# define MOD

# define INF

# define mem(a,b) memset(a,b,sizeof(a))

# define FOR(i,a,n) for(int i=a; i<=n; ++i)

# define FO(i,a,n) for(int i=a; i<n; ++i)

# define bug puts("H");

# define lch p<<,l,mid

# define rch p<<|,mid+,r

# define mp make_pair

# define pb push_back

typedef pair<int,int> PII;

typedef vector<int> VI;

# pragma comment(linker, "/STACK:1024000000,1024000000")

typedef long long LL;

int Scan() {

    int res=, flag=;

    char ch;

    if((ch=getchar())=='-') flag=;

    else if(ch>=''&&ch<='') res=ch-'';

    while((ch=getchar())>=''&&ch<='')  res=res*+(ch-'');

    return flag?-res:res;

}

void Out(int a) {

    if(a<) {putchar('-'); a=-a;}

    if(a>=) Out(a/);

    putchar(a%+'');

}

const int N=;

//Code begin...

struct qnode{

    int v, c;

    qnode(int _v=, int _c=):v(_v),c(_c){}

    bool operator<(const qnode &r)const{return c>r.c;}

};

struct Edge{

    int v, cost;

    Edge(int _v=, int _cost=):v(_v),cost(_cost){}

};

vector<Edge>E[N];

LL dp[N][N];

int dis[N][N], dist[N];

bool vis[N];

double ans[N];

priority_queue<qnode>que;

void Dijkstra(int n, int start){

    mem(vis,);

    FOR(i,,n) dist[i]=INF;

    dist[start]=; que.push(qnode(start,)); dp[start][start]=;

    qnode tmp;

    while (!que.empty()) {

        tmp=que.top(); que.pop();

        int u=tmp.v;

        if (vis[u]) continue;

        vis[u]=true;

        FO(i,,E[u].size()) {

            int v=E[u][i].v, cost=E[u][i].cost;

            if (dist[v]==dist[u]+cost) {dp[start][v]+=dp[start][u]; continue;}

            if (!vis[v]&&dist[v]>dist[u]+cost) {

                dist[v]=dist[u]+cost, que.push(qnode(v,dist[v]));

                dp[start][v]=dp[start][u];

            }

        }

    }

    FOR(i,,n) dis[start][i]=dist[i];

}

int main ()

{

    int n, m, u, v, w;

    scanf("%d%d",&n,&m);

    FOR(i,,m) scanf("%d%d%d",&u,&v,&w), E[u].pb(Edge(v,w)), E[v].pb(Edge(u,w));

    FOR(i,,n) Dijkstra(n,i);

    FOR(i,,n) FOR(j,,n) {

        if (i==j) continue;

        FOR(k,,n) {

            if (k==i||k==j) continue;

            if (dis[j][i]+dis[i][k]==dis[j][k]) ans[i]+=((double)dp[j][i]*dp[i][k])/(dp[j][k]);

        }

    }

    FOR(i,,n) printf("%.3f\n",ans[i]);

    return ;

}