#include <iostream>
#include <cstdio>
#include <unordered_map>
using namespace std;

const int N = 3e5 + 5, M = 6e5 + 5;

typedef long long LL;
typedef unordered_map<int, int>::iterator MIT;
int n, m, K, f[N], sz[N], szE[N], hh = 1, tt, A[M * 20], B[M * 20];

LL ans;

unordered_map<int, int> s[N];

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

void inline insert(int a, int k, int v) {
	if (s[a].count(k)) A[++tt] = s[a][k], B[tt] = v, szE[a]++;
	else s[a][k] = v;
}

void inline merge(int x, int y) {
	x = find(x), y = find(y);
	if (szE[x] > szE[y]) swap(x, y);
	ans += (LL)sz[x] * sz[y];
	for (MIT it = s[x].begin(); it != s[x].end(); it++)
		insert(y, it -> first, it -> second);
	szE[y] += szE[x], sz[y] += sz[x], f[x] = y;
}

int main() {
	scanf("%d%d%d", &n, &m, &K);
	for (int i = 1; i <= n; i++) f[i] = i, sz[i] = 1;
	for (int i = 1; i <= m; i++) {
		int u, v, w; scanf("%d%d%d", &u, &v, &w);
		insert(v, w, u);
	}
	while (hh <= tt) {
		int a = A[hh], b = B[hh]; hh++;
		if (find(a) != find(b)) merge(a, b);
	}
	printf("%lld\n", ans);
	return 0;
}