Shichikuji is the new resident deity of the South Black Snail Temple. Her first job is as follows:

There are n new cities located in Prefecture X. Cities are numbered from 1 to n. City i is located ~x_i~ km North of the shrine and ~y_i~ km East of the shrine. It is possible that ~(x_i,y_i)=(x_j,y_j)~ even when ~i\ne j~.

Shichikuji must provide electricity to each city either by building a power station in that city, or by making a connection between that city and another one that already has electricity. So the City has electricity if it has a power station in it or it is connected to a City which has electricity by a direct connection or via a chain of connections.

Building a power station in City i will cost ~c_i~ yen; Making a connection between City i and City j will cost ~k_i+k_j~ yen per km of wire used for the connection. However, wires can only go the cardinal directions (North, South, East, West). Wires can cross each other. Each wire must have both of its endpoints in some cities. If City i and City j are connected by a wire, the wire will go through any shortest path from City i to City j. Thus, the length of the wire between Cities i and j is equal to the Manhattan Distance between them. Shichikuji wants to do this job spending as little money as possible, since according to her, there isn't really anything else in the world other than money. However, she died when she was only in fifth grade so she is not smart enough for this. And thus, the new resident deity asks for your help.

And so, you have to provide Shichikuji with the following information: minimum amount of yen needed to provide electricity to all cities.

Input

First line of input contains a single integer n (~1\le n\le 2000~): the number of cities. Then, n lines follow. The ith line contains two space separated integers ~x_i~ (~1\le x_i \le 10^6~) and ~y_i~ (~1\le y_i\le 10^6~): the coordinates of the ith city.

The next line contains n space separated integers ~c_1,c_2,...,c_n~ (~1\le c_i\le 10^9~): the cost of building a power station in the ith city.

The last line contains n space separated integers ~k_1,k_2,...,k_n~ (~1\le k_i\le 10^9~).

Output

Print a single integer, the minimum amount of yen.

Examples

Input

3
2 3
1 1
3 2
3 2 3
3 2 3

Output

8

Input

3
2 1
1 2
3 3
23 2 23
3 2 3

Output

27

Note

For the first example, the cost of building power stations in all cities is 3+2+3=8

• It can be shown that no configuration costs less than 8 yen.

For the second example, the cost of building a power station in City 2 is 2. The cost of connecting City 1 and City 2 is 2x(3+2)=10

• The cost of connecting City 2 and City 3 is 3x(2+3)=15
• Thus the total cost is 2+10+15=27
• It can be shown that no configuration costs less than 27 yen.

For the original problem, and diagrams of the samples, visit https://codeforces.com/contest/1245/problem/D.