#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const long long N = 1e3 + 5;
void pairsort(long long a[], long long b[], long long n) {
  pair<long long, long long> pairt[n];
  for (long long i = 0; i < n; i++) {
    pairt[i].first = a[i];
    pairt[i].second = b[i];
  }
  sort(pairt, pairt + n);
  for (long long i = 0; i < n; i++) {
    a[i] = pairt[i].first;
    b[i] = pairt[i].second;
  }
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long isPrime(long long n) {
  if (n < 2) return 0;
  if (n < 4) return 1;
  if (n % 2 == 0 or n % 3 == 0) return 0;
  for (long long i = 5; i * i <= n; i += 6)
    if (n % i == 0 or n % (i + 2) == 0) return 0;
  return 1;
}
long long C(long long n, long long r) {
  if (r > n - r) r = n - r;
  long long ans = 1;
  for (long long i = 1; i <= r; i++) {
    ans *= n - r + i;
    ans /= i;
  }
  return ans;
}
long long mod = 1e9 + 7;
long long modexpo(long long x, long long p) {
  long long res = 1;
  x = x % mod;
  while (p) {
    if (p % 2) res = res * x;
    p >>= 1;
    x = x * x % mod;
    res %= mod;
  }
  return res;
}
long long n, m, w, W[N], B[N], dp[N][N], vis[N], p = 1, x, y;
map<long long, long long> cw, cb;
vector<long long> v[N];
void dfs(long long x) {
  vis[x] = p;
  for (long long i = 0; i < v[x].size(); i++)
    if (!vis[v[x][i]]) dfs(v[x][i]);
}
struct st {
  long long b;
  long long w;
};
vector<st> s[N];
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> m >> w;
  for (long long i = 1; i <= n; i++) cin >> W[i];
  for (long long i = 1; i <= n; i++) cin >> B[i];
  for (long long i = 1; i <= m; i++)
    cin >> x >> y, v[x].push_back(y), v[y].push_back(x);
  for (long long i = 1; i <= n; i++)
    if (!vis[i]) dfs(i), p++;
  p--;
  for (long long i = 1; i <= n; i++) {
    cb[vis[i]] += B[i], cw[vis[i]] += W[i];
    st cur;
    cur.b = B[i], cur.w = W[i];
    s[vis[i]].push_back(cur);
  }
  for (long long i = 1; i <= p; i++)
    for (long long j = 0; j <= w; j++) {
      dp[i][j] = (dp[i][j] > dp[i - 1][j] ? dp[i][j] : dp[i - 1][j]);
      if (j >= cw[i])
        dp[i][j] = (dp[i][j] > cb[i] + dp[i - 1][j - cw[i]]
                        ? dp[i][j]
                        : cb[i] + dp[i - 1][j - cw[i]]);
      for (long long k = 0; k < s[i].size(); k++)
        if (j >= s[i][k].w)
          dp[i][j] = (dp[i][j] > dp[i - 1][j - s[i][k].w] + s[i][k].b
                          ? dp[i][j]
                          : dp[i - 1][j - s[i][k].w] + s[i][k].b);
    }
  cout << dp[p][w];
  return 0;
}
