#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<set>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
using namespace std;
struct Node{
int v,w,next;
}a[10005];
int dfn[10005],c,low[10005];
int block[10005],bc;
int ins[10005];
stack<int> s;
int p[10005],e;
int x,y,z;
int n,m;
void qxx(int u,int v,int w){
a[++e].v=v;
a[e].w=w;
a[e].next=p[u];
p[u]=e;
}
void tarjin(int u,int fa){
bool flag=1;
dfn[u]=low[u]=++c;
ins[u]=1;s.push(u);
for(int i=p[u];i;i=a[i].next){
int v=a[i].v;
if(v==fa&&flag){
flag=0;
continue;
}
if(!dfn[v]){
tarjin(v,u);
low[u]=min(low[u],low[v]);
if(low[v]>dfn[u]){
bc++;
int i;
block[u]=bc;
do{
i=s.top();
ins[i]=0;
block[i]=bc;
s.pop();
}while(i!=v);
}
}
else low[u]=min(low[u],dfn[v]);
}
}
int main(){
freopen("20.in","r",stdin);
freopen("20.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&z);
qxx(x,y,z);
}
tarjin(1,1);
return 0;
}