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 T1, typename T2>
void chkmin(T1 &x, T2 y) {
  if (x > y) x = y;
}
template <typename T1, typename T2>
void chkmax(T1 &x, T2 y) {
  if (x < y) x = y;
}
namespace fastio {
char rbuf[1 << 23], *p1 = rbuf, *p2 = rbuf, wbuf[1 << 23], *p3 = wbuf;
inline char getc() {
  return p1 == p2 &&
                 (p2 = (p1 = rbuf) + fread(rbuf, 1, 1 << 23, stdin), p1 == p2)
             ? -1
             : *p1++;
}
inline void putc(char x) { (*p3++ = x); }
template <typename T>
void read(T &x) {
  x = 0;
  char c = getchar();
  T neg = 0;
  while (!isdigit(c)) neg |= !(c ^ '-'), c = getchar();
  while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  if (neg) x = (~x) + 1;
}
template <typename T>
void recursive_print(T x) {
  if (!x) return;
  recursive_print(x / 10);
  putc(x % 10 ^ 48);
}
template <typename T>
void print(T x) {
  if (!x) putc('0');
  if (x < 0) putc('-'), x = ~x + 1;
  recursive_print(x);
}
void print_final() { fwrite(wbuf, 1, p3 - wbuf, stdout); }
}  // namespace fastio
const int MAXN = 2e5;
const int INF = 0x3f3f3f3f;
int n, a[MAXN + 5], hd[MAXN + 5], to[MAXN * 2 + 5], nxt[MAXN * 2 + 5],
    val[MAXN * 2 + 5], ec = 0;
void adde(int u, int v, int w) {
  to[++ec] = v;
  val[ec] = w;
  nxt[ec] = hd[u];
  hd[u] = ec;
}
bool vis[MAXN + 5];
int siz[MAXN + 5], mx[MAXN + 5], cent = 0;
int ans = 0;
double mn = 1e25, sum[MAXN + 5], sum1 = 0, sum2 = 0;
void findcent(int x, int f, int totsiz) {
  mx[x] = 0;
  siz[x] = 1;
  for (int e = hd[x]; e; e = nxt[e]) {
    int y = to[e];
    if (y == f || vis[y]) continue;
    findcent(y, x, totsiz);
    siz[x] += siz[y];
    chkmax(mx[x], siz[y]);
  }
  chkmax(mx[x], totsiz - siz[x]);
  if (mx[x] < mx[cent]) cent = x;
}
void calc(int x, int f, int rt, int dep) {
  sum1 += 1.0 * a[x] * dep * sqrt(dep);
  sum2 += 1.0 * a[x] * sqrt(dep) * 3 / 2;
  sum[rt] += 1.0 * a[x] * sqrt(dep) * 3 / 2;
  for (int e = hd[x]; e; e = nxt[e]) {
    int y = to[e], z = val[e];
    if (y == f) continue;
    calc(y, x, rt, dep + z);
  }
}
void divcent(int x) {
  if (vis[x]) return;
  vis[x] = 1;
  sum1 = sum2 = 0;
  for (int e = hd[x]; e; e = nxt[e]) {
    int y = to[e], z = val[e];
    sum[y] = 0;
    calc(y, x, y, z);
  }
  if (sum1 < mn) mn = sum1, ans = x;
  for (int e = hd[x]; e; e = nxt[e]) {
    int y = to[e], z = val[e];
    if (sum2 - sum[y] * 2.0 < 0) {
      cent = 0;
      findcent(y, x, siz[y]);
      divcent(cent);
      return;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1, u, v, w; i < n; i++)
    scanf("%d%d%d", &u, &v, &w), adde(u, v, w), adde(v, u, w);
  mx[0] = INF;
  cent = 0;
  findcent(1, 0, n);
  divcent(cent);
  printf("%d %.15lf\n", ans, mn);
  return 0;
}
