public int find(int n, int m, int[][] edges) {
        // Sort edges by decreasing order of reward
        Arrays.sort(edges, (a, b) -> Integer.compare(b[2], a[2]));

        // Initialize disjoint-set data structure
        int[] parent = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            parent[i] = i;
        }

        // Use Kruskal's algorithm to find minimum spanning tree
        int totalReward = 0;
        int numComponents = n;
        for (int[] edge : edges) {
            int parentA = findParent(edge[0], parent);
            int parentB = findParent(edge[1], parent);
            if (parentA != parentB) {
                // Removing this edge would connect two previously disjoint components
                parent[parentB] = parentA;
                totalReward += edge[2];
                numComponents--;
                if (numComponents <= 1) {
                    // All nodes are now in one connected component
                    break;
                }
            }
        }

        return totalReward;
    }

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