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 = 200003;
int n, ans1, a[N], head[N], to[N << 1], nxt[N << 1], w[N << 1];
template <typename T>
inline bool chkmin(T &a, const T &b) {
  if (a > b) return a = b, 1;
  return 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  if (a < b) return a = b, 1;
  return 0;
}
template <typename T>
inline void read(T &x) {
  int ch = getchar();
  x = 0;
  for (; ch < '0' || ch > '9'; ch = getchar())
    ;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
}
inline void add(int a, int b, int c) {
  static int cnt = 0;
  to[++cnt] = b;
  nxt[cnt] = head[a];
  head[a] = cnt;
  w[cnt] = c;
}
int siz[N], wson[N], rt, tot;
bool vis[N];
inline void dfs(int x, int f = 0) {
  siz[x] = 1;
  for (register int i = head[x]; i; i = nxt[i])
    if (to[i] != f && !vis[to[i]]) {
      dfs(to[i], x);
      siz[x] += siz[to[i]];
      chkmax(wson[x], siz[to[i]]);
    }
  chkmax(wson[x], tot - siz[x]);
  if (wson[x] < wson[rt]) rt = x;
}
double sum, sumd, d[N], ans2 = 1e20;
inline void calc(int x, int f, int rt, int len) {
  double sqr = sqrt(len) * a[x];
  sum += len * sqr;
  d[rt] += sqr;
  siz[x] = 1;
  for (register int i = head[x]; i; i = nxt[i])
    if (to[i] != f) {
      calc(to[i], x, rt, len + w[i]);
      siz[x] += siz[to[i]];
    }
}
inline void dac(int x) {
  if (vis[x]) return;
  vis[x] = true;
  sum = sumd = 0;
  for (register int i = head[x]; i; i = nxt[i]) {
    d[to[i]] = 0;
    calc(to[i], x, to[i], w[i]);
    sumd += d[to[i]];
  }
  if (chkmin(ans2, sum)) ans1 = x;
  for (register int i = head[x]; i; i = nxt[i])
    if (sumd < d[to[i]] * 2) {
      tot = siz[to[i]];
      rt = 0;
      dfs(x);
      dac(rt);
      break;
    }
}
int main() {
  read(n);
  for (register int i = 1; i <= n; ++i) read(a[i]);
  for (register int i = 1, u, v, w; i < n; ++i) {
    read(u);
    read(v);
    read(w);
    add(u, v, w);
    add(v, u, w);
  }
  wson[rt = 0] = 1e9;
  dfs(1);
  dac(rt);
  printf("%d %.10lf\n", ans1, ans2);
}
