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 int N = 2e5 + 10;
const double INF = 1e19 + 10;
int tot, head, tail, ans1;
int fir[N], size[N], que[N], maxn[N], vis[N];
long long v[N], dep[N];
double now[N], ans2 = INF, ans_sum = 0;
struct edge {
  int to;
  int dis;
  int nxt;
} e[N << 1];
inline void add(int x, int y, int z) {
  e[++tot].to = y;
  e[tot].nxt = fir[x];
  e[tot].dis = z;
  fir[x] = tot;
  e[++tot].to = x;
  e[tot].nxt = fir[y];
  e[tot].dis = z;
  fir[y] = tot;
}
inline void dfs(int p, int fa) {
  ans_sum += dep[p] * sqrt(dep[p]) * v[p];
  size[p] = 1, que[++tail] = p;
  for (int i = fir[p]; i; i = e[i].nxt) {
    int q = e[i].to;
    if (q == fa || vis[q]) continue;
    dep[q] = dep[p] + e[i].dis;
    dfs(q, p), size[p] += size[q];
    maxn[p] = max(maxn[p], size[q]);
  }
}
inline void solve(int p, int all) {
  int pos = 0, minn = N, rt;
  head = 1, tail = 0, dfs(p, 0);
  for (int i = 1; i <= tail; i++)
    maxn[que[i]] = max(maxn[que[i]], all - size[que[i]]);
  for (int i = 1; i <= tail; i++)
    if (maxn[que[i]] < minn) minn = maxn[que[i]], rt = que[i];
  vis[rt] = 1, head = 1, tail = 0;
  double sum = 0;
  ans_sum = 0;
  for (int i = fir[rt]; i; i = e[i].nxt) {
    int q = e[i].to;
    if (vis[q]) continue;
    now[q] = 0, dep[q] = e[i].dis;
    dfs(q, 0);
    for (int i = head; i <= tail; i++)
      now[q] += 1.5 * v[que[i]] * sqrt(dep[que[i]]);
    sum += now[q];
    head = tail + 1;
  }
  if (ans_sum < ans2) ans2 = ans_sum, ans1 = p;
  for (int i = fir[rt]; i; i = e[i].nxt) {
    int q = e[i].to;
    if (vis[q]) continue;
    if (sum * 2 - now[q] < 0) solve(q, size[q]);
  }
}
int main() {
  int n, a, b, c;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &v[i]);
  for (int i = 1; i < n; i++) scanf("%d%d%d", &a, &b, &c), add(a, b, c);
  solve(1, n);
  printf("%d %.7lf\n", ans1, ans2);
  return 0;
}
