这数据没谁了

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define div() cout << "\n-----------------------\n";
#define debug(n) cout << #n << " = " << n << "\n";
#define deb(n) cout << #n << " = " << n << "    ";
int n,m,W;
struct cloud{int w,v,group;}a[10005];
bool cmp(cloud x, cloud y){return x.group < y.group;}
int groups[10005];int gnumv[10005],gnumw[10005];
vector<int>l[10005];
bool vis[10005];int cnt;
int dp[10005];
void dfs(int now,int groupnum){
	vis[now] = 1;a[now].group = groupnum;
	for(auto x : l[now]){
		if(!vis[x]){dfs(x,groupnum);}
	}
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m >> W;
    for(int i = 1;i <= n;i++){cin >> a[i].w >> a[i].v;}
    for(int i = 1;i <= m;i++){
		int u,v;cin >> u >> v;
		l[u].push_back(v);l[v].push_back(u);
	}
	for(int i = 1;i <= n;i++){if(!vis[i]){dfs(i,++cnt);}}
	sort(a+1,a+n+1,cmp);
	int sumw = a[1].w,sumv = a[1].v;
	for(int i = 2;i <= n+1;i++){
		if(a[i].group != a[i-1].group){
			gnumv[a[i-1].group] = sumv;gnumw[a[i-1].group] = sumw;
			sumv = a[i].v;sumw = a[i].w;
		}
		else{sumw += a[i].w;sumv += a[i].v;}
	}
    for(int i = 1;i <= n;i++){
		a[i].v = gnumv[a[i].group];
		a[i].w = gnumw[a[i].group];
	}
	for(int i = 1;i <= n;i++){
		for(int j = W;j >= a[i].w;j--){
			dp[j] = max(dp[j],dp[j-a[i].w] + a[i].v);
		}
	}
	cout << dp[W];
	return 0;
}