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>
int sz[200010], fr[200010], v[400010], w[400010], ne[400010], bs = 0;
void addb(int a, int b, int c) {
  v[bs] = b;
  w[bs] = c;
  ne[bs] = fr[a];
  fr[a] = bs++;
}
double cal(int u, int f, long long h) {
  double rt = sz[u] * pow(h, 1.5);
  for (int i = fr[u]; i != -1; i = ne[i]) {
    if (v[i] != f) rt += cal(v[i], u, h + w[i]);
  }
  return rt;
}
bool bk[200010];
int count(int u, int f) {
  int rt = 1;
  for (int i = fr[u]; i != -1; i = ne[i]) {
    if (v[i] != f && !bk[v[i]]) rt += count(v[i], u);
  }
  return rt;
}
int mi, xx;
int dfs0(int u, int f, int nn) {
  int rt = 1, ma = 0;
  for (int i = fr[u]; i != -1; i = ne[i]) {
    if (v[i] != f && !bk[v[i]]) {
      int t = dfs0(v[i], u, nn);
      rt += t;
      if (t > ma) ma = t;
    }
  }
  if (nn - rt > ma) ma = nn - rt;
  if (ma < mi) mi = ma, xx = u;
  return rt;
}
int getzx(int u) {
  mi = 1e9;
  int nn = count(u, 0);
  dfs0(u, 0, nn);
  return xx;
}
double qiudao(int u, int f, long long h) {
  double rt = sz[u] * sqrt(h);
  for (int i = fr[u]; i != -1; i = ne[i]) {
    if (v[i] != f && !bk[v[i]]) rt += cal(v[i], u, h + w[i]);
  }
  return rt;
}
double ans = 1e30;
int wz;
void dfs(int u, double jg) {
  u = getzx(u);
  bk[u] = true;
  if (jg < ans) ans = jg, wz = u;
  double dh = qiudao(u, 0, 0), zx = 1e20;
  int wi = -1;
  for (int i = fr[u]; i != -1; i = ne[i]) {
    if (bk[v[i]]) continue;
    double d = qiudao(v[i], u, w[i]);
    if (dh - d * 2 < zx) zx = dh - d * 2, wi = i;
  }
  if (wi == -1) return;
  double tj = cal(v[wi], 0, 0);
  if (tj < jg) dfs(v[wi], tj);
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    fr[i] = -1;
    scanf("%d", &sz[i]);
  }
  for (int i = 0; i < n - 1; i++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    addb(a, b, c);
    addb(b, a, c);
  }
  dfs(1, cal(1, 0, 0));
  printf("%d %.8lf", wz, ans);
  return 0;
}
