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 T>
inline T read() {
  T f = 0, x = 0;
  char c = getchar();
  while (!isdigit(c)) f = c == '-', c = getchar();
  while (isdigit(c)) x = x * 10 + c - 48, c = getchar();
  return f ? -x : x;
}
namespace run {
const int N = 2e5 + 9;
const double eps = 1e-12;
int n, val[N], head[N], nex[N << 1], to[N << 1], w[N << 1], cnt;
inline void add(int u, int v, int c) {
  nex[++cnt] = head[u], head[u] = cnt, to[cnt] = v, w[cnt] = c;
  nex[++cnt] = head[v], head[v] = cnt, to[cnt] = u, w[cnt] = c;
}
bool cut[N];
int siz[N], tot, mx, rt;
inline void getrt(int u, int _f) {
  siz[u] = 1;
  int _mx = 0;
  for (int i = head[u]; i; i = nex[i])
    if (to[i] ^ _f && !cut[to[i]]) {
      getrt(to[i], u), siz[u] += siz[to[i]];
      _mx = max(_mx, siz[to[i]]);
    }
  _mx = max(_mx, tot - siz[u]);
  if (_mx < mx) rt = u, mx = _mx;
}
double f[N], ans = 1e30, res;
int pos;
inline void dfs(int u, int _f, int dist) {
  f[u] = 1.5 * sqrt(dist) * val[u], res += 1. * val[u] * pow(dist, 1.5);
  for (int i = head[u]; i; i = nex[i])
    if (to[i] ^ _f) dfs(to[i], u, dist + w[i]), f[u] += f[to[i]];
}
inline void cess(int u, int _f) {
  siz[u] = 1;
  for (int i = head[u]; i; i = nex[i])
    if (to[i] ^ _f) cess(to[i], u), siz[u] += siz[to[i]];
}
inline void solve(int u, int _tot) {
  tot = _tot, mx = tot, rt = 0, getrt(u, 0);
  res = 0., dfs(rt, 0, 0), cut[rt] = 1;
  double sum = 0.;
  if (res < ans) ans = res, pos = rt;
  for (int i = head[rt]; i; i = nex[i]) sum += f[to[i]];
  for (int i = head[rt]; i; i = nex[i])
    if (sum - 2 * f[to[i]] < eps && !cut[to[i]])
      return cess(rt, to[i]), solve(to[i], siz[to[i]]);
}
int main() {
  n = read<int>();
  for (int i = 1; i <= n; i++) val[i] = read<int>();
  for (int i = 1; i < n; i++) {
    int u = read<int>(), v = read<int>(), c = read<int>();
    add(u, v, c);
  }
  solve(1, n);
  printf("%d %.10lf\n", pos, ans);
  return 0;
}
}  // namespace run
int main() { return run::main(); }
