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 int read() {
  char ch = getchar();
  int res = 0, flag = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    res = res * 10 + ch - '0';
    ch = getchar();
  }
  return res * flag;
}
int n, w[200001], head[200001], to[400001], nxt[400001], d[400001], tot, x, y,
    z, ans1, rt, siz[200001], f[200001];
double sum1, sum2, ans2 = (1e18), g[200001];
bool vis[200001];
inline void add(int x, int y, int z) {
  to[++tot] = y;
  d[tot] = z;
  nxt[tot] = head[x];
  head[x] = tot;
}
void dfs1(int x, int fa, int Siz) {
  f[x] = 0;
  siz[x] = 1;
  for (register int i = head[x]; i; i = nxt[i])
    if (to[i] != fa && !vis[to[i]]) {
      dfs1(to[i], x, Siz);
      siz[x] += siz[to[i]];
      f[x] = max(f[x], siz[to[i]]);
    }
  f[x] = max(f[x], Siz - siz[x]);
  if (f[x] < f[rt]) rt = x;
}
void dfs2(int x, int fa, int xx, int dis) {
  sum1 += 1.0L * w[x] * sqrt((double)dis) * dis;
  sum2 += 1.0L * w[x] * sqrt((double)dis) * 3.0 / 2.0;
  g[y] += 1.0L * w[x] * sqrt((double)dis) * 3.0 / 2.0;
  for (register int i = head[x]; i; i = nxt[i])
    if (to[i] != fa) dfs2(to[i], x, xx, dis + d[i]);
}
void dfs3(int x) {
  if (vis[x]) return;
  vis[x] = 1;
  sum1 = sum2 = 0.0;
  for (register int i = head[x]; i; i = nxt[i]) {
    g[to[i]] = 0.0;
    dfs2(to[i], x, to[i], d[i]);
  }
  if (sum1 < ans2) {
    ans1 = x;
    ans2 = sum1;
  }
  for (register int i = head[x]; i; i = nxt[i])
    if (sum2 < g[to[i]] * 2.0) {
      rt = 0;
      dfs1(to[i], x, siz[to[i]]);
      dfs3(rt);
      break;
    }
}
int main() {
  n = read();
  for (register int i = 1; i <= n; ++i) w[i] = read();
  for (register int i = 1; i < n; ++i) {
    x = read();
    y = read();
    z = read();
    add(x, y, z);
    add(y, x, z);
  }
  f[rt = 0] = (1e9);
  dfs1(1, 0, n);
  dfs3(rt);
  printf("%d %.8lf\n", ans1, ans2);
  return 0;
}
