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
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e5 + 7;
const long long INF = 1e9 + 7;
long long a[MAXN];
struct edge {
  long long next, to, cost;
} es[MAXN * 2];
long long tot, head[MAXN];
void addEdge(long long a, long long b, long long c) {
  es[tot].to = b;
  es[tot].cost = c;
  es[tot].next = head[a];
  head[a] = tot++;
}
void init() {
  tot = 0;
  memset(head, -1, sizeof(head));
}
long long id, sum, N;
double ans = 0.0;
void dfs2(long long u, long long pre, long long dis) {
  ans += a[u] * pow(dis, 1.5);
  for (long long i = head[u]; ~i; i = es[i].next) {
    long long v = es[i].to;
    if (v == pre) continue;
    dfs2(v, u, dis + es[i].cost);
  }
}
int main() {
  scanf("%lld", &N);
  for (long long i = 1; i <= N; ++i) scanf("%lld", &a[i]);
  init();
  sum = 0;
  for (long long i = 1; i < N; ++i) {
    long long a, b, c;
    scanf("%lld%lld%lld", &a, &b, &c);
    sum += c;
    addEdge(a, b, c);
    addEdge(b, a, c);
  }
  double res = 1e16;
  id = 0;
  for (int i = 0; i < 2000; ++i) {
    int x = rand() % N + 1;
    ans = 0.0;
    dfs2(x, -1, 0);
    if (ans < res) {
      res = ans;
      id = x;
    }
  }
  printf("%lld %.8f\n", id, res);
  return 0;
}
