A1286 | [COCI-2012_2013-olympiad]#4 SPIJUNI

You are M, the head of the intelligence agency which employs N spies with codenames from 1 to N.
Each of the spies has been assigned a different country and obtained an important piece of information there. Your task is the following:
1. Organize meetings between some of the spies. In each meeting, exactly two spies meet and exchange all information that they have obtained themselves or learned from other spies in previous meetings. Organizing a top-secret meeting between two spies in different countries is difficult, so each potential meeting has a price.
2. After all the meetings have concluded, select a subset of spies and send them together on the world-saving (and woman-romancing) assignment. Sending a spy k on the assignment costs Mk .
For the assignment to succeed, it is important that the spies together know all the information obtained by the remaining spies.
Find the minimum total price of preparing and executing this assignment.

The first line of input contains the positive integer N, the number of spies (2 ≤ N ≤ 1000).
Each of the following N lines contains N positive integers not exceeding 106 . The number in row k and column m represents the price of a meeting between spies k and m and, of course, equals the number in row m and column k (for k = m the number will be 0).
The following line contains N positive integers Mk (1 ≤ Mk ≤ 106 ), the prices of sending each spy on the assignment, in order for spies 1, 2, ..., N.

The first and only line of output must contain the required minimum total price.