public int find(int n, int m, int[][] edges) {
        Arrays.sort(edges, (a, b) -> Integer.compare(b[2], a[2]));
        int[] parent = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            parent[i] = i;
        }

        int totalReward = 0;
        for (int[] edge : edges) {
            int parentA = findParent(edge[0], parent);
            int parentB = findParent(edge[1], parent);
            if (parentA != parentB) {
                // Removing this edge would disconnect the graph
                parent[parentB] = parentA;
            } else {
                // Removing this edge would not disconnect the graph
                totalReward += edge[2];
            }
        }

        return totalReward;
    }

    private int findParent(int node, int[] parent) {
        if (parent[node] != node) {
            parent[node] = findParent(parent[node], parent);
        }
        return parent[node];
    }