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;
template <typename tp>
inline void read(tp &x) {
  x = 0;
  char c = getchar();
  int f = 0;
  for (; c < '0' || c > '9'; f |= c == '-', c = getchar())
    ;
  for (; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0', c = getchar())
    ;
  if (f) x = -x;
}
const int N = 3e5 + 233;
struct E {
  int nxt, to, w;
} e[N << 2];
int head[N], e_cnt = 0;
int sz[N], f[N], vis[N], root, all, a[N];
double s[N], s2[N], dep[N];
pair<double, int> ans;
int n, m;
inline void adde(int x, int y, int w) {
  e[++e_cnt] = (E){head[x], y, w};
  head[x] = e_cnt;
}
inline void frt(int u, int fat) {
  sz[u] = 1;
  f[u] = 0;
  for (register int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (vis[v] || v == fat) continue;
    frt(v, u);
    sz[u] += sz[v];
    f[u] = max(f[u], sz[v]);
  }
  f[u] = max(f[u], all - sz[u]);
  if (!root || f[root] > f[u]) root = u;
}
inline void fsz(int u, int fat) {
  sz[u] = 1;
  for (register int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (vis[v] || v == fat) continue;
    fsz(v, u);
    sz[u] += sz[v];
  }
}
inline void init() {
  memset(s, 0, sizeof s);
  memset(s2, 0, sizeof s2);
  memset(dep, 0, sizeof dep);
}
inline void dfs(int u, int fat) {
  s[u] = a[u] * pow(dep[u], 3. / 2);
  s2[u] = a[u] * 3. / 2 * pow(dep[u], 1. / 2);
  for (register int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fat) continue;
    dep[v] = dep[u] + e[i].w;
    dfs(v, u);
    s[u] += s[v];
    s2[u] += s2[v];
  }
}
inline void work(int u, int fat) {
  vis[u] = true;
  init();
  dfs(u, 0);
  ans = min(ans, make_pair(s[u], u));
  int nxt = -1;
  for (register int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fat || vis[v]) continue;
    if (nxt == -1 || s2[nxt] < s2[v]) nxt = v;
  }
  if (nxt == -1) return;
  fsz(nxt, u);
  all = sz[nxt];
  frt(nxt, root = 0);
  work(root, u);
}
int main(void) {
  read(n);
  ans = make_pair(1e99, 0);
  for (register int i = 1; i <= (n); i++) read(a[i]);
  for (register int i = 1; i <= (n - 1); i++) {
    int x, y, w;
    read(x), read(y), read(w);
    adde(x, y, w);
    adde(y, x, w);
  }
  all = n;
  frt(1, 0);
  work(root, 0);
  printf("%d %.10lf\n", ans.second, ans.first);
}
