write a go solution for Description:
You are given a tree consisting of n vertices. Some vertices of the tree are red, all other vertices are blue.

Each edge of the tree has a positive weight. Let's define d(x,y) as the distance between the vertices x and y, i. e. the sum of weights of edges belonging to the simple path between x and y.

For each vertex, you have to choose an integer v_i. These integers should meet the following constraint: for every blue vertex b and every red vertex r, d(b,r)>=v_b+v_r.

You have to maximize the value of sumlimits_i=1^nv_i.

Note that the values of v_i are not necessarily positive.

Input Format:
The first line contains one integer n (2<=n<=3*10^5).

The second line contains n integers c_1,c_2,...,c_n (0<=c_i<=1). If the i-th vertex is red, c_i=1, otherwise c_i=0.

Then n-1 lines follow. Each line contains three integers x_i, y_i and w_i (1<=x_i,y_i<=n; 1<=w_i<=10^6; x_iney_i) denoting an edge between the vertices x_i and y_i which has weight w_i. These edges form a tree.

Output Format:
If the value of sumlimits_i=1^nv_i can be as big as possible, print Infinity. Otherwise, print one integer — the maximum possible value of sumlimits_i=1^nv_i you can get.

Note:
In the first example, you can assign v_1=120,v_2=20,v_3=80,v_4=130.. Output only the code with no comments, explanation, or additional text.