这题需要注意b[i]和c[i]是索引,而不是金币数即可



import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner=new Scanner(System.in);
		int n=scanner.nextInt();
		int a[]=new int[n];
		for (int i = 0; i < a.length; i++) {
			a[i]=scanner.nextInt();
		}
		int b[]=new int[n];
		int c[]=new int[n];
		for (int i = 0; i < c.length; i++) {
			b[i]=scanner.nextInt();
			c[i]=scanner.nextInt();
		}
		int count=0;
		for (int i = 0; i < a.length; i++) {
			if(a[i]>a[b[i]-1]+a[c[i]-1]) {
				count+=a[b[i]-1]+a[c[i]-1];
			}else {
				count+=a[i];
			}
		}
		System.out.println(count);

	}

}