qwq

#include<bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int,int>
#define fir first
#define sec second
#define mem(arr,val) memset(arr,val,sizeof arr)
using namespace std;
const int N=1510,M=5010,INF=0x3f3f3f3f,Mod=1e9+7;
int read() {int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9') {if(ch=='-') f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;}
void Write(int x) {if(x<0) {putchar('-'),Write(-x);return;}if(x<10) {putchar(x+'0');return;}Write(x/10),putchar(x%10+'0');}
void write(int x,char *s) {Write(x),printf("%s",s);}
int n,m,id,l,r,len,to[M],w[M],ne[M],ans[M],head[N],q[N],dis[N],vis[N],pre[N],suf[N],deg[N];
vector<int>rnk,G[N];
inline int ADD(int x,int y) {return x+y>=Mod?x+y-Mod:x+y;}
inline int MUL(int x,int y) {return 1ll*x*y%Mod;}
void add(int x,int y,int z) {to[++id]=y,w[id]=z,ne[id]=head[x],head[x]=id;}
void spfa(int s)
{
	mem(dis,0x3f),mem(vis,0),q[l=r=1]=s,dis[s]=0;for(int i=1;i<=n;i++) pre[i]=1;
	while(l<=r)
	{
		int u=q[l++];vis[u]=0;
		for(int i=head[u];i;i=ne[i])
		{
			int v=to[i];
			if(dis[u]+w[i]<dis[v])
			{
				dis[v]=dis[u]+w[i],pre[v]=0;
				if(!vis[v]) vis[v]=1,q[++r]=v;
			}
			if(dis[u]+w[i]==dis[v]) pre[v]=ADD(pre[v],pre[u]);
		}
	}
}
void topo(int s)
{
	mem(deg,0);for(int i=1;i<=n;i++) G[i].clear(),suf[i]=1;
	for(int u=1;u<=n;u++)
		for(int i=head[u],v;i;i=ne[i])
			if(dis[u]+w[i]==dis[v=to[i]]) G[u].push_back(v),deg[v]++;
	q[l=r=1]=s,rnk.clear();
	while(l<=r)
	{
		int u=q[l++];rnk.push_back(u);
		for(int v:G[u])
			if(!--deg[v]) q[++r]=v;
	}
	reverse(rnk.begin(),rnk.end());
	for(int u:rnk)
		for(int v:G[u]) suf[u]=ADD(suf[u],suf[v]);
	for(int u=1;u<=n;u++)
		for(int i=head[u],v;i;i=ne[i])
			if(dis[u]+w[i]==dis[v=to[i]]) ans[i]=ADD(ans[i],MUL(pre[u],suf[v]));
}
void solve()
{
	n=read(),m=read();
	for(int x,y,z;m--;) x=read(),y=read(),z=read(),add(x,y,z);
	for(int s=1;s<=n;s++) spfa(s),topo(s);
	for(int i=1;i<=id;i++) write(ans[i],"\n");
}
signed main()
{
	int T=1;
	while(T--) solve();
}