1 //minamoto
 2 #include<iostream>
 3 #include<cstdio>
 4 #include<cstring>
 5 #define ll long long
 6 using namespace std;
 7 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
 8 char buf[1<<21],*p1=buf,*p2=buf;
 9 inline ll read(){
10     #define num ch-'0'
11     char ch;bool flag=0;ll res;
12     while((ch=getc())>'9'||ch<'0')
13     (ch=='-')&&(flag=true);
14     for(res=num;(ch=getc())<='9'&&ch>='0';res=res*10+num);
15     (flag)&&(res=-res);
16     #undef num
17     return res;
18 }
19 const int N=4e5+5,mod=1e9+7;
20 ll ans;
21 int n,m,top,cnt,cir,u,v;ll e;
22 int head[N],q[N],ver[N<<2],Next[N<<2],tot;ll edge[N<<2];
23 ll b[105],bin[105],circle[N],dis[N],dig[2];
24 inline void add(int u,int v,ll e){
25     ver[++tot]=v,Next[tot]=head[u],head[u]=tot,edge[tot]=e;
26 }
27 void dfs(int u,int fa,ll d){
28     dis[u]=d,q[++top]=u;
29     for(int i=head[u];i;i=Next[i]){
30         int v=ver[i];
31         if(v!=fa){
32             if(dis[v]==-1) dfs(v,u,dis[u]^edge[i]);
33             else circle[++cir]=dis[u]^dis[v]^edge[i];
34         }
35     }
36 }
37 inline void insert(ll x){
38     for(int i=63;i>=0;--i)
39     if(x>>i&1){
40         if(!b[i]) return (void)(b[i]=x,++cnt);
41         x^=b[i];
42     }
43 }
44 void init(){
45     memset(b,0,sizeof(b)),cnt=0;
46     for(int i=1;i<=cir;++i) insert(circle[i]);
47 }
48 void calc(){
49     init();
50     for(int j=0;j<=63;++j){
51         bool flag=0;dig[0]=dig[1]=0;
52         for(int i=1;i<=top;++i) dig[dis[q[i]]>>j&1]++;
53         for(int i=0;i<=63;++i)
54         if(b[i]>>j&1){flag=1;break;}
55         ll res;
56         if(flag){
57             res=(dig[0]*(dig[0]-1)/2+dig[1]*(dig[1]-1)/2)%mod;
58             if(cnt) (res*=bin[cnt-1])%=mod;
59             (res*=bin[j])%=mod;
60             (ans+=res)%=mod;
61         }
62         res=dig[0]*dig[1]%mod;
63         if(flag){if(cnt) (res*=bin[cnt-1])%=mod;}
64         else (res*=bin[cnt])%=mod;
65         (res*=bin[j])%=mod;
66         (ans+=res)%=mod;
67     }
68 }
69 int main(){
70 //    freopen("testdata.in","r",stdin);
71     memset(dis,-1,sizeof(dis));
72     bin[0]=1;for(int i=1;i<=63;++i) bin[i]=(bin[i-1]<<1)%mod;
73     n=read(),m=read();
74     for(int i=1;i<=m;++i){
75         u=read(),v=read(),e=read();
76         add(u,v,e),add(v,u,e);
77     }
78     for(int i=1;i<=n;++i)
79     if(dis[i]==-1)
80     top=cir=0,dfs(i,0,0),calc();
81     printf("%lld\n",ans);
82     return 0;
83 }