#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5;
const long long M = 1e5 + 5;
const long long LG = 20;
long long n, m;
long long level[N];
int32_t maxwt[LG][M], parentt[LG][M];
long long storeu[N], storev[N], storew[N];
long long dist[N], parent[N];
bool vis[N];
vector<pair<long long, long long> > g[N], tree[N];
long long primsMST(long long source) {
  for (long long i = 1; i <= n; i++) dist[i] = 1e9;
  set<pair<long long, long long> > s;
  s.insert({0, source});
  long long cost = 0;
  dist[source] = 0;
  while (!s.empty()) {
    auto x = *(s.begin());
    s.erase(x);
    if (vis[x.second]) continue;
    vis[x.second] = 1;
    cost += x.first;
    long long u = x.second;
    long long v = parent[x.second];
    long long w = x.first;
    tree[u].push_back({v, w});
    tree[v].push_back({u, w});
    for (auto it : g[x.second]) {
      if (vis[it.first]) continue;
      if (dist[it.first] > it.second) {
        s.erase({dist[it.first], it.first});
        dist[it.first] = it.second;
        s.insert({dist[it.first], it.first});
        parent[it.first] = x.second;
      }
    }
  }
  return cost;
}
void dfs(long long k, long long par, long long w, long long lvl) {
  level[k] = lvl;
  maxwt[0][k] = w;
  parentt[0][k] = par;
  for (auto it : tree[k]) {
    if (it.first == par) continue;
    dfs(it.first, k, it.second, lvl + 1);
  }
}
void precompute() {
  for (long long j = 1; j < LG; j++) {
    for (long long i = 1; i <= n; i++) {
      parentt[j][i] = parentt[j - 1][parentt[j - 1][i]];
      maxwt[j][i] = max(maxwt[j - 1][i], maxwt[j - 1][parentt[j - 1][i]]);
    }
  }
}
long long LCA(long long u, long long v) {
  if (level[u] < level[v]) swap(u, v);
  long long diff = level[u] - level[v];
  long long ans = 0;
  for (long long i = LG - 1; i >= 0; i--) {
    if ((1 << i) & diff) {
      ans = max(ans, (long long)maxwt[i][u]);
      u = parentt[i][u];
    }
  }
  if (u == v) return ans;
  for (long long i = LG - 1; i >= 0; i--) {
    if (parentt[i][u] && parentt[i][u] != parentt[i][v]) {
      ans = max(ans, (long long)maxwt[i][u]);
      ans = max(ans, (long long)maxwt[i][v]);
      u = parentt[i][u];
      v = parentt[i][v];
    }
  }
  ans = max(ans, (long long)maxwt[0][u]);
  ans = max(ans, (long long)maxwt[0][v]);
  return ans;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> m;
  for (long long i = 1; i <= m; i++) {
    long long u, v, w;
    cin >> u >> v >> w;
    storeu[i] = u, storev[i] = v, storew[i] = w;
    g[u].push_back({v, w});
    g[v].push_back({u, w});
  }
  long long ans = primsMST(1);
  dfs(1, 1, 0, 1);
  precompute();
  for (long long i = 1; i <= m; i++) {
    long long remove = LCA(storeu[i], storev[i]);
    long long cur = storew[i] - remove;
    if (cur > 0) cout << remove << "\n";
  }
  return 0;
}
