问题 E: 搭配购买

#include<bits/stdc++.h>
using namespace std;
#define rush() int T;cin>>T;while(T--)
#define sf(a) scanf("%d\n",&a)
#define sft(a,b) scanf("%d%d",&a,&b)
#define go(a) while(scanf("%d",&a)!=EOF)
#define ms(a,b) memset(a,b,sizeof a)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define pf(a) printf("%.8lf",a)
#define E 1e-8
using namespace std;
typedef long long ll;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const int idata = 1e4 + 5;
 
int n, m, t, f;
int i, j, k;
int fa[idata];
int w[idata], v[idata];
int dp[idata];
 
int Find(int son)
{
    if (fa[son] != son) fa[son] = Find(fa[son]);
    return fa[son];
}
void Union(int x, int y)
{
    int nx = Find(x), ny = Find(y);
    if (nx != ny)
    {
        fa[ny] = nx;
        w[nx] += w[ny];
        v[nx] += v[ny];
        /*fa[nx]=ny;
        w[ny]+=w[nx];
        v[ny]+=v[nx];也可以是这个*/
    }
}
int main()
{
    cin.tie(0);
    iostream::sync_with_stdio(false);
    while (cin >> n >> m >> f)
    {
        for (i = 1; i <= n; i++) fa[i] = i;
        for (i = 1; i <= n; i++)
        {
            cin >> w[i] >> v[i];
        }
        for (i = 1; i <= m; i++)
        {
            int x, y;
            cin >> x >> y;
            if (Find(x) != Find(y)) Union(x, y);
        }
        int cnt = 0;
        for (i = 1; i <= n; i++)
        {
            if (fa[i] == i)
            {
                v[++cnt] = v[i];
                w[cnt] = w[i];
            }
        }
        for (i = 1; i <= cnt; i++)
        {
            for (j = f; j >= w[i]; j--)
            {
                dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
            }
        }
        cout << dp[f] << endl;
    }
    return 0;
}