Rt，他给我报错是merge里面size爆longlong了，我怀疑可能是重复建边，求大佬帮忙调调/kel

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,P,Q;
int vis[100005];
struct bin
{
	int f[100005];
	long long size[100005];
	bin(){for(int i=1;i<=100000;i++) f[i]=i;}
	int find(int x){return f[x]==x?x:f[x]=find(f[x]);}
	void merge(int x,int y,int w){size[find(y)]+=size[find(x)]+w;f[find(x)]=find(y);}
}b;
struct node
{
	int id;
	long long val;
	friend bool operator<(node x,node y){return x.val>y.val;}
};
priority_queue<node>q;
int main()
{
	scanf("%d%d%d%d",&n,&m,&P,&Q);
	for(int i=1;i<=m;i++)
	{
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		b.merge(u,v,w);
	}
	for(int i=1;i<=n;i++)
		if(!vis[b.find(i)]) vis[b.find(i)]=1,q.push((node){b.find(i),b.size[b.find(i)]});
	// printf("%llu\n",q.size());
	if((int)q.size()<Q||(int)q.size()-P>Q||(m==0&&Q-n==0&&P!=0)){puts("NO");return 0;}
	else puts("YES");
	while((int)q.size()>Q)
	{
		P--;
		int a=q.top().id;q.pop();
		int c=q.top().id;q.pop();
		printf("%d %d\n",a,c);
		b.merge(a,c,b.size[b.find(a)]+b.size[b.find(c)]+1);
		q.push((node){b.find(a),b.size[b.find(a)]});
	}
	while(P>0)
	{
		P--;
		printf("%d %d\n",1,b.find(1));
	}
	return 0;
}