从1到n内，查找父指针为0且权值最小的树，分别赋给i，j-From 1 to n inside, find the parent pointer is zero and the minimum weight of the tree, were assigned to i, j