3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.LinkedList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author xwchen
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        LinkedList<Pair<Integer, Integer>>[] adj = null;
        boolean[] removed = null;
        int[] subTreeSize = null;
        int[] w;
        int subTreeCount = 0;
        int bestIndex;
        double best;
        double[] costs = null;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            w = in.nextIntArray(n);
            adj = new LinkedList[n];
            for (int i = 0; i < n; ++i) {
                adj[i] = new LinkedList<>();
            }
            removed = new boolean[n];
            subTreeSize = new int[n];
            costs = new double[n];
            Arrays.fill(costs, -1);
            best = 1e18;
            for (int i = 0; i < n; ++i) {
                adj[i] = new LinkedList<>();
            }
            for (int i = 0; i < n - 1; ++i) {
                int a = in.nextInt();
                int b = in.nextInt();
                int len = in.nextInt();
                --a;
                --b;
                addEdge(a, b, len);
                addEdge(b, a, len);
            }
            decompose(0);
            out.println((bestIndex + 1) + " " + best);
        }

        double getCost(int u, int pre, long len) {
            double sum = w[u] * len * Math.sqrt(len);
            for (Pair<Integer, Integer> e : adj[u]) {
                int v = e.x;
                int lv = e.y;
                if (v != pre) {
                    sum += getCost(v, u, len + lv);
                }
            }
            return sum;
        }

        void decompose(int root) {
            subTreeCount = getSubtreeSize(root, -1);
            int centroid = findCentroid(root, -1);
            removed[centroid] = true;
            if (costs[centroid] < -1e-5) {
                costs[centroid] = getCost(centroid, -1, 0);
                if (best > costs[centroid]) {
                    best = costs[centroid];
                    bestIndex = centroid;
                }
            }
            for (Pair<Integer, Integer> pair : adj[centroid]) {
                costs[pair.x] = getCost(pair.x, -1, 0);
                if (costs[pair.x] < best) {
                    best = costs[pair.x];
                    bestIndex = pair.x;
                    decompose(bestIndex);
                }
            }
        }

        int getSubtreeSize(int u, int pre) {
            subTreeSize[u] = 1;
            for (Pair<Integer, Integer> e : adj[u]) {
                int v = e.x;
                if (v != pre && !removed[v]) {
                    subTreeSize[u] += getSubtreeSize(v, u);
                }
            }
            return subTreeSize[u];
        }

        int findCentroid(int u, int pre) {
            for (Pair<Integer, Integer> e : adj[u]) {
                int v = e.x;
                if (v == pre && !removed[v] && subTreeSize[v] > subTreeCount / 2) {
                    return findCentroid(v, u);
                }
            }
            return u;
        }

        void addEdge(int u, int v, int len) {
            adj[u].add(new Pair<>(v, len));
        }

    }

    static class Pair<K, V> implements Comparable<Pair> {
        public K x;
        public V y;

        public Pair(K x, V y) {
            this.x = x;
            this.y = y;
        }

        public Pair() {

        }

        public int compareTo(Pair o) {
            if (compareNumber(x, o.x) != 0) {
                return compareNumber(x, o.x);
            } else {
                return compareNumber(y, o.y);
            }
        }

        private int compareNumber(Object o1, Object o2) {
            if (o1 instanceof Integer && o2 instanceof Integer) {
                return ((Integer) o1).compareTo((Integer) o2);
            } else if (o1 instanceof Long && o2 instanceof Long) {
                return ((Long) o1).compareTo((Long) o2);
            } else if (o1 instanceof Double && o2 instanceof Double) {
                return ((Double) o1).compareTo((Double) o2);
            } else {
                System.out.println("Unsupported Type");
                return 0;
            }
        }

    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer = new StringTokenizer("");

        public InputReader(InputStream inputStream) {
            this.reader = new BufferedReader(
                    new InputStreamReader(inputStream));
        }

        public String next() {
            while (!tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return tokenizer.nextToken();
        }

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

        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

    }
}

