#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int fa[maxn], cnt[maxn][2], w[maxn]; vector<pair<int, int>> e; int ans = -1, pans = -1; int n, k; int find(int i) { return fa[i] == i ? i : fa[i] = find(fa[i]); } set<int> aa; void merge(int x, int y)...