Sadonkorjuu

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        Solver solver = new Solver();
        System.out.println(solver.Solve());
    }
}


class Solver{

    public int Solve() throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        // INPUT
        int cityCount = Integer.parseInt(bufferedReader.readLine());
        String[] cityTypes = bufferedReader.readLine().split(" ");
        City[] cities = new City[cityCount];
        for(int i = 0; i < cityCount; i++){
            cities[i] = new City(i, Integer.parseInt(cityTypes[i]) == 1);
        }
        for(int i = 0; i < cityCount - 1; i++){
            String[] inp = bufferedReader.readLine().split(" ");
            cities[Integer.parseInt(inp[0]) - 1].AddConnection(cities[Integer.parseInt(inp[1]) - 1], Integer.parseInt(inp[2]));
            cities[Integer.parseInt(inp[1]) - 1].AddConnection(cities[Integer.parseInt(inp[0]) - 1], Integer.parseInt(inp[2]));
        }

        // test generator
        /*int cityCount = 200000;
        City[] cities = new City[cityCount];
        for(int i = 0; i < cityCount; i++){
            cities[i] = new City(i, i < 200000 / 200); // amount of fields
        }
        for(int i = 0; i < cityCount - 1; i++){
            Random random = new Random();
            int randomIndex;
            do {
                randomIndex = random.nextInt(cityCount);
            }
            while (randomIndex == i);

            String[] inp = {String.valueOf(i), String.valueOf(randomIndex), "1"};
            cities[Integer.parseInt(inp[0])].AddConnection(cities[Integer.parseInt(inp[1])], Integer.parseInt(inp[2]));
            cities[Integer.parseInt(inp[1])].AddConnection(cities[Integer.parseInt(inp[0])], Integer.parseInt(inp[2]));
        }*/
        
        //long start = System.currentTimeMillis();

        // ALG
        for(int i = 0; i < cityCount; i++){
            if (!cities[i].isField){
                if(!cities[i].HasFieldConnection()){
                    continue;
                }
                boolean[] usedFlags = new boolean[cityCount];
                CalculateShortestPaths(cities[i], 0, usedFlags);
            }
        }

        int totalLength = 0;
        for(int i = 0; i < cityCount; i++){
            if (cities[i].isField){
                //System.out.println(String.valueOf(i) + " -> " + String.valueOf(cities[i].shortestPath));
                totalLength += cities[i].shortestPath;
            }
        }

        //long finish = System.currentTimeMillis();
        //System.out.println((finish - start) / 1000.0);

        return totalLength;
    }
    

    void CalculateShortestPaths(City city, int totalCost, boolean[] usedFlags){
        for (Connection connection : city.connections) {
            int thisID = connection.destination.cityID;
            if (usedFlags[thisID]) { continue; } 
            if (!connection.destination.isField) { continue; }
            else {
                int newCost = totalCost + connection.cost;
                if (newCost < connection.destination.shortestPath){
                    connection.destination.shortestPath = newCost;
                } else { continue; }
            }

            usedFlags[thisID] = true;
            CalculateShortestPaths(connection.destination, totalCost + connection.cost, usedFlags);
            usedFlags[thisID] = false;
        }
    }



    class City {
        public int cityID;
        public boolean isField;
        public List<Connection> connections;
        public int shortestPath = Integer.MAX_VALUE;
    
        public City(int cityID, boolean isField){
            this.cityID = cityID;
            this.isField = isField;
            connections = new ArrayList<Connection>();  
        }
    
        public void AddConnection(City destination, int cost) {
            connections.add(new Connection(destination, cost));
        }

        public boolean HasFieldConnection() {
            boolean flag = false;
            for(int i = 0; i < connections.size(); i++){
                if (connections.get(i).destination.isField){
                    flag = true;
                    break;
                }
            }
            return flag;
        }
    }
    
    class Connection {
        public City destination;
        public int cost;
    
        public Connection(City destination, int cost){
            this.destination = destination;
            this.cost = cost;
        }
    }
}

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: ACCEPTED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 1, 2

Verdict: ACCEPTED

Test 16

Group: 1, 2

Verdict: ACCEPTED

Test 17

Group: 1, 2

Verdict: ACCEPTED

Test 18

Group: 1, 2

Verdict: ACCEPTED

Test 19

Group: 1, 2

Verdict: ACCEPTED

Test 20

Group: 1, 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 1, 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 1, 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 1, 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: ACCEPTED

Test 30

Group: 1, 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: ACCEPTED