Given an undirected graph with `n` nodes labeled `1..n`. Some of the nodes are already connected. The `i-th` edge connects nodes `edges[i][0]` and `edges[i][1]` together. Your task is to augment this set of edges with additional edges to connect all the nodes. Find the minimum cost to add new edges between the nodes such that all the nodes are accessible from each other.\n\nInput:\n* `n`, an int representing the total number of nodes.\n* `edges`, a list of integer pair representing the nodes already connected by an edge.\n* `newEdges`, a list where each element is a triplet representing the pair of nodes between which an edge can be added and the cost of addition, respectively (e.g. [1, 2, 5] means to add an edge between node 1 and 2, the cost would be 5). \n\n**Example 1:**\n```\nInput: n = 6, edges = [[1, 4], [4, 5], [2, 3]], newEdges = [[1, 2, 5], [1, 3, 10], [1, 6, 2], [5, 6, 5]]\nOutput: 7\nExplanation:\nThere are 3 connected components [1, 4, 5], [2, 3] and [6].\nWe can connect these components into a single component by connecting node 1 to node 2 and node 1 to node 6 at a minimum cost of 5 + 2 = 7.\n```\n\n<details> \n  <summary>Solution</summary>\n\nJava solution using Kruskal\'s MST algorithm: https://leetcode.com/playground/7d5AeuFc\n</details>\n\nRelated problems:\n* [Min Cost to Repair Edges](https://leetcode.com/discuss/interview-question/357310)\n* https://leetcode.com/problems/connecting-cities-with-minimum-cost (premium)

Given an undirected graph with n nodes labeled 1..n. Some of the nodes are already connected. The i-th edge connects nodes edges[i][0] and edges[i][1] together.