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;
inline long long read() {
  long long kkk = 0, x = 1;
  char c = getchar();
  while ((c < '0' || c > '9') && c != '-') c = getchar();
  if (c == '-') c = getchar(), x = -1;
  while (c >= '0' && c <= '9')
    kkk = (kkk << 3) + (kkk << 1) + (c - '0'), c = getchar();
  return kkk * x;
}
long long n, num[200001], head[200001], tot, pd[200001], size[200001],
    son[200001], root, all, ans1;
double ans2 = -1, D[200001], sum;
struct sb {
  long long to, nextn, l;
} a[400001];
inline void ADD(long long from, long long to, long long l) {
  a[++tot].to = to, a[tot].nextn = head[from], a[tot].l = l;
  head[from] = tot;
}
inline void find(long long u, long long fa) {
  size[u] = 1, son[u] = 0;
  for (register long long i = head[u]; i != 0; i = a[i].nextn) {
    long long v = a[i].to;
    if (v == fa || pd[v]) continue;
    find(v, u);
    size[u] += size[v];
    son[u] = max(son[u], size[v]);
  }
  son[u] = max(son[u], all - size[u]);
  if (son[u] < son[root]) root = u;
}
inline void dfs(long long u, long long fa, long long dis) {
  D[u] = (double)num[u] * sqrt(dis);
  sum += (double)num[u] * sqrt(dis) * dis;
  for (register long long i = head[u]; i != 0; i = a[i].nextn) {
    long long v = a[i].to;
    if (v == fa) continue;
    dfs(v, u, dis + a[i].l);
    D[u] += D[v];
  }
}
inline void fun(long long u) {
  pd[u] = 1;
  sum = 0;
  dfs(u, 0, 0);
  if (sum < ans2 || ans2 == -1) ans1 = u, ans2 = sum;
  for (register long long i = head[u]; i != 0; i = a[i].nextn) {
    long long v = a[i].to;
    if (pd[v] || D[u] - 2 * D[v] >= 0) continue;
    all = size[v];
    root = 0;
    find(v, u);
    fun(root);
    break;
  }
}
signed main() {
  n = read();
  for (register long long i = 1; i <= n; ++i) num[i] = read();
  for (register long long i = 1; i < n; ++i) {
    long long u = read(), v = read(), l = read();
    ADD(u, v, l);
    ADD(v, u, l);
  }
  son[0] = 0x3f3f3f3f3f3f3f3f;
  all = n;
  find(1, 0);
  fun(root);
  printf("%lld %.18lf\n", ans1, ans2);
  return 0;
}
