/* Rozwiazanie wzorcowe do zadania WZN
 * Autor: JR
 */

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int M = 500000;

int n, m;
vector<int> t[M];

long long sqr(long long x) {
  return x * x;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  while (m--) {
    int u, v, w;
    cin >> u >> v >> w;
    --u; --v;
    t[u].push_back(w);
    t[v].push_back(w);
  }
  long long wyn = 0;
  for (int i = 0; i < n; ++i) {
    wyn += sqr(t[i].size());
    sort(t[i].begin(), t[i].end());
    int j = 0;
    while (j < (int)t[i].size()) {
      int j0 = j;
      while (j0 < (int)t[i].size() && t[i][j0] == t[i][j])
        ++j0;
      wyn -= sqr(j0 - j);
      j = j0;
    }
  }
  cout << wyn / 2 << endl;
}