#include<cstdio>

 #include<algorithm>

 using namespace std;

 const int maxn=,Mod=;

 int n,m,tot,sum,ans=,cnt,st[maxn],fa[maxn],num[maxn];

 struct edge{int x,y,dis,pos;}e[maxn];

 void read(int &k){

     k=; int f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

     while(''<=c&&c<='')k=k*+c-'',c=getchar();

     k*=f;

 }

 int find(int x){return fa[x]==x?x:find(fa[x]);}

 void dfs(int kind,int now,int chosen){

     if (now==st[kind+]){

         if (chosen==num[kind]) sum++;

         return;

     }

     int p=find(e[now].x),q=find(e[now].y);

     if (p!=q) fa[p]=q,dfs(kind,now+,chosen+),fa[p]=p,fa[q]=q;

     dfs(kind,now+,chosen);

 }

 bool cmp(edge a,edge b){return a.dis<b.dis;}

 int main(){

     read(n); read(m);

     for (int i=;i<=m;i++)read(e[i].x),read(e[i].y),read(e[i].dis);

     sort(e+,e+m+,cmp);

     for (int i=;i<=m;i++) {

         if (e[i].dis!=e[i-].dis) st[++cnt]=i;

         e[i].pos=cnt;

     }

     st[cnt+]=m+;

     for (int i=;i<=n;i++) fa[i]=i;

     for (int i=,x,y;i<=m;i++)

         if ((x=find(e[i].x))!=(y=find(e[i].y))) fa[x]=y,num[e[i].pos]++,tot++;

     if (tot!=n-) return puts(""),;

     for (int i=;i<=n;i++) fa[i]=i;

     for (int i=;i<=cnt;i++) if(num[i]){

         sum=; dfs(i,st[i],);

         for (int j=st[i];j<st[i+];j++) fa[find(e[j].x)]=find(e[j].y);

         ans=1LL*ans*sum%Mod;

     }

     printf("%d",ans);

     return ;

 }