Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Arpa's weak amphitheater and Mehrdad's valuable Hoses

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputJust to remind, girls in Arpa's land are really nice.

Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weight *w* _{ i} and some beauty *b* _{ i}. Also each Hos may have some friends. Hoses are divided in some friendship groups. Two Hoses *x* and *y* are in the same friendship group if and only if there is a sequence of Hoses *a* _{1}, *a* _{2}, ..., *a* _{ k} such that *a* _{ i} and *a* _{ i + 1} are friends for each 1 ≤ *i* < *k*, and *a* _{1} = *x* and *a* _{ k} = *y*.

Arpa allowed to use the amphitheater of palace to Mehrdad for this party. Arpa's amphitheater can hold at most *w* weight on it.

Mehrdad is so greedy that he wants to invite some Hoses such that sum of their weights is not greater than *w* and sum of their beauties is as large as possible. Along with that, from each friendship group he can either invite all Hoses, or no more than one. Otherwise, some Hoses will be hurt. Find for Mehrdad the maximum possible total beauty of Hoses he can invite so that no one gets hurt and the total weight doesn't exceed *w*.

Input

The first line contains integers *n*, *m* and *w* (1 ≤ *n* ≤ 1000, , 1 ≤ *w* ≤ 1000) — the number of Hoses, the number of pair of friends and the maximum total weight of those who are invited.

The second line contains *n* integers *w* _{1}, *w* _{2}, ..., *w* _{ n} (1 ≤ *w* _{ i} ≤ 1000) — the weights of the Hoses.

The third line contains *n* integers *b* _{1}, *b* _{2}, ..., *b* _{ n} (1 ≤ *b* _{ i} ≤ 10^{6}) — the beauties of the Hoses.

The next *m* lines contain pairs of friends, the *i*-th of them contains two integers *x* _{ i} and *y* _{ i} (1 ≤ *x* _{ i}, *y* _{ i} ≤ *n*, *x* _{ i} ≠ *y* _{ i}), meaning that Hoses *x* _{ i} and *y* _{ i} are friends. Note that friendship is bidirectional. All pairs (*x* _{ i}, *y* _{ i}) are distinct.

Output

Print the maximum possible total beauty of Hoses Mehrdad can invite so that no one gets hurt and the total weight doesn't exceed *w*.

Examples

Input

3 1 5

3 2 5

2 4 2

1 2

Output

6

Input

4 2 11

2 4 6 6

6 4 2 1

1 2

2 3

Output

7

Note

In the first sample there are two friendship groups: Hoses {1, 2} and Hos {3}. The best way is to choose all of Hoses in the first group, sum of their weights is equal to 5 and sum of their beauty is 6.

In the second sample there are two friendship groups: Hoses {1, 2, 3} and Hos {4}. Mehrdad can't invite all the Hoses from the first group because their total weight is 12 > 11, thus the best way is to choose the first Hos from the first group and the only one from the second group. The total weight will be 8, and the total beauty will be 7.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/04/2020 23:29:15 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|