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;
struct edge {
  int s, t, l, nxt;
} e[200005];
int last[100005], e_cnt;
void ins(int a, int b, int c) {
  e[e_cnt] = (edge){a, b, c, last[a]};
  last[a] = e_cnt++;
}
int w[100005];
bool vis[100005];
int fa[100005], size[100005], mx[100005];
void dfs0(int x) {
  if (vis[x]) return;
  size[x] = 1;
  for (int i = last[x]; i != -1; i = e[i].nxt)
    if (e[i].t != fa[x]) {
      fa[e[i].t] = x;
      dfs0(e[i].t);
      size[x] += size[e[i].t];
    }
}
int r, alls;
void dfs1(int x) {
  if (vis[x]) return;
  mx[x] = alls - size[x];
  for (int i = last[x]; i != -1; i = e[i].nxt)
    if (e[i].t != fa[x]) {
      dfs1(e[i].t);
      mx[x] = max(mx[x], size[e[i].t]);
    }
  if (r == -1 || mx[x] < mx[r]) r = x;
}
double t[100005];
double dfs2(int x, int d) {
  t[x] = sqrt(d) * w[x];
  double tem = pow(sqrt(d), 3) * w[x];
  for (int i = last[x]; i != -1; i = e[i].nxt)
    if (e[i].t != fa[x]) {
      fa[e[i].t] = x;
      tem += dfs2(e[i].t, d + e[i].l);
      t[x] += t[e[i].t];
    }
  return tem;
}
double ans = 1e18;
int ansx;
void solve(int x) {
  fa[x] = 0;
  dfs0(x);
  r = -1;
  alls = size[x];
  dfs1(x);
  fa[r] = 0;
  vis[r] = 1;
  double res = dfs2(r, 0);
  if (res < ans) {
    ansx = r;
    ans = res;
  }
  for (int i = last[r]; i != -1; i = e[i].nxt)
    if (!vis[e[i].t] && t[e[i].t] * 2 > t[r]) {
      solve(e[i].t);
    }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  memset(last, -1, sizeof(last));
  for (int i = 1; i < n; i++) {
    int u, v, l;
    scanf("%d%d%d", &u, &v, &l);
    ins(u, v, l);
    ins(v, u, l);
  }
  solve(1);
  printf("%d %lf\n", ansx, ans);
  return 0;
}
