Sadonkorjuu

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class E430 {

	static int n;
	static ArrayList<WeightedNode> ports = new ArrayList<>();

	static long[] mins;

	public static void main(String[] args) throws FileNotFoundException {

		FastReader reader = new FastReader();
		PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));

		n = reader.nextInt();
		mins = new long[n + 1];
		ArrayList<WeightedNode> nodes = new ArrayList<>();

		int a, b, c, t;
		// City types
		for (int id = 1; id < (n + 1); id++) {
			t = reader.nextInt();
			WeightedNode node = new WeightedNode(id, t, id - 1);
			if (t == 0) {
				ports.add(node);
			}
			nodes.add(node);
		}

		WeightedGraph graph = new WeightedGraph(nodes);

		// Connections
		for (int i = 0; i < (n - 1); i++) {
			a = reader.nextInt() - 1;
			b = reader.nextInt() - 1;
			c = reader.nextInt();
			graph.addWeightedEdge(a, b, c);
		}

		reader.close();

		for (WeightedNode port : ports)
			graph.dijkstra(port);

		long sum = 0;

		for (long value : mins) {
			sum += value;
		}
		writer.println(sum);
		writer.flush();
		writer.close();
	}

	// ------------------------------------------------------

	static long lowestExpense = Long.MAX_VALUE;
	
	static class WeightedGraph {
		ArrayList<WeightedNode> nodes = new ArrayList<WeightedNode>();
		static PriorityQueue<WeightedNode> queue;

		public WeightedGraph(ArrayList<WeightedNode> nodes) {
			this.nodes = nodes;
		}

		void dijkstra(WeightedNode node) {
			if (queue == null)
				queue = new PriorityQueue<>();
			else
				queue.clear();
			node.distance = 0;

			queue.addAll(nodes);

			long expense = 0;
			
			while (!queue.isEmpty()) {
				
				if (expense > lowestExpense) {
					break;
				}
				WeightedNode current = queue.remove();
				
				for (WeightedNode neighbor : current.neighbors) {
					if (neighbor.type == 0) continue;
					
					if (queue.contains(neighbor)) {
						if (neighbor.distance > current.distance + current.weightMap.get(neighbor.id)) {
							neighbor.distance = (current.distance + current.weightMap.get(neighbor.id));

							if (mins[neighbor.id] != 0) {
								mins[neighbor.id] = Math.min(mins[neighbor.id], (long) neighbor.distance);
							} else {
								mins[neighbor.id] = (long) neighbor.distance;
							}

							neighbor.parent = current;
							expense += neighbor.distance;
							lowestExpense = Math.min(lowestExpense, expense);
							queue.remove(neighbor);
							queue.add(neighbor);
						}
					}
					
				}

			}

		}

		void addWeightedEdge(int a, int b, int c) {
			WeightedNode first = nodes.get(a);
			WeightedNode second = nodes.get(b);
			first.neighbors.add(second);
			first.weightMap.put(second.id, c);
			second.neighbors.add(first);
			second.weightMap.put(first.id, c);
		}
	}

	static class WeightedNode implements Comparable<WeightedNode> {
		int id;
		int type;
		ArrayList<WeightedNode> neighbors = new ArrayList<>();
		HashMap<Integer, Integer> weightMap = new HashMap<>();
		boolean visited = false;
		WeightedNode parent;
		long distance;
		int index;

		public WeightedNode(int id, int type, int index) {
			this.id = id;
			this.type = type;
			distance = 1001;
			this.index = index;
		}

		@Override
		public int compareTo(WeightedNode o) {
			return (int) (this.distance - o.distance);
		}

	}

	static class FastReader {

		private BufferedReader br;
		private StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		public FastReader(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
				e.printStackTrace();
			}
			st = null;
			br = null;
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		String nextLine() {
			String str = "";

			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}

			return str;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		BigInteger nextBigInteger() {
			return new BigInteger(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

	}

}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 1, 2

Verdict: WRONG ANSWER

Test 16

Group: 1, 2

Verdict: WRONG ANSWER

Test 17

Group: 1, 2

Verdict: ACCEPTED

Test 18

Group: 1, 2

Verdict: WRONG ANSWER

Test 19

Group: 1, 2

Verdict: WRONG ANSWER

Test 20

Group: 1, 2

Verdict: WRONG ANSWER

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 1, 2

Verdict: WRONG ANSWER

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 1, 2

Verdict: WRONG ANSWER

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 1, 2

Verdict: WRONG ANSWER

Test 29

Group: 2

Verdict: WRONG ANSWER

Test 30

Group: 1, 2

Verdict: WRONG ANSWER

Test 31

Group: 2

Verdict: WRONG ANSWER