代码：

#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 5;
int f[N], wi[N], ci[N], ui, vi;
int dp[N];
vector<int> g[N];
int n, m, w, p;
int find(int x)
{
    return f[x] == x ? x : f[x] = find(f[x]);
}
void merge(int x, int y)
{
    int fx = find(x), fy = find(y);
    if (fx != fy)
    {
        f[fx] = fy;
        wi[fx] += wi[fy];
    }
}
int main()
{
    cin >> n >> m >> w;
    for (int i = 1; i <= n; i++)
        f[i] = i;
    for (int i = 1; i <= n; ++i)
        cin >> wi[i] >> ci[i];
    for (int i = 1; i <= m; i++)
    {
        cin >> ui >> vi;
        merge(ui, vi);
        g[f[ui]].push_back(i);
    }
    for (int i = 1; i <= n; i++)
        if (f[i] == i)
            p++;
    for (int i = 1; i <= p; ++i)
        for (int j = w; j >= 0; --j)
            for (int k = 0; k < g[i].size(); ++k)
            {
                int x = g[i][k];
                if (j >= wi[x])
                    dp[j] = max(dp[j], dp[j - wi[x]] + ci[x]);
            }
    cout << dp[w];
    return 0;
}