#include<bits/stdc++.h>
using namespace std;
const int N=50001;
int n,m,k,fa[N],f[N],w[N],v[N];
vector<int> s,t;
int find(int x)
{
    if (x!=fa[x])
	  fa[x]=find(fa[x]);
	else
      return fa[x];
}
int main()
{
	ios::sync_with_stdio(0);
	cin>>n>>m>>k;
    for (int i=1;i<=n;i++) 
	  fa[i]=i;
    for (int i=1;i<=n;i++) 
	  cin>>w[i]>>v[i];
    for (int i=1;i<=m;i++)
    {
        int a,b;
		cin>>a>>b;
        int x=find(a),y=find(b);
        if (x!=y)
        {
            fa[x]=y;
            w[y]+=w[x];
            v[y]+=v[x];
        }
    }
    for (int i=1;i<=n;i++)
      if (fa[i]==i)
      {
        t.push_back(w[i]);
        s.push_back(v[i]);
      }
    for (int i=0;i<t.size();i++)
      for (int j=k;j>=t[i];j--)
        f[j]=max(f[j],f[j-t[i]]+s[i]);
    cout<<f[k];
    return 0;
}

这是记录