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;
char rr[1 << 22], *csy1, *csy2;
template <class T>
inline void RI(T &t) {
  char c = (csy1 == csy2 && (csy2 = (csy1 = rr) + fread(rr, 1, 1 << 22, stdin),
                             csy1 == csy2)
                ? EOF
                : *csy1++);
  for (t = 0; c < 48 || c > 57;
       c = (csy1 == csy2 && (csy2 = (csy1 = rr) + fread(rr, 1, 1 << 22, stdin),
                            csy1 == csy2)
                ? EOF
                : *csy1++))
    ;
  for (; c > 47 && c < 58;
       c = (csy1 == csy2 && (csy2 = (csy1 = rr) + fread(rr, 1, 1 << 22, stdin),
                            csy1 == csy2)
                ? EOF
                : *csy1++))
    t = (t << 1) + (t << 3) + c - 48;
}
const int Maxn = 200005;
int n, w[Maxn];
struct Edge {
  int y, prev, z;
} e[Maxn << 1];
int elast[Maxn], ecnt;
char del[Maxn];
int ms[Maxn], sz[Maxn], rt;
int c;
double f[Maxn], ans;
inline void Build(int x, int y, int z) {
  e[++ecnt] = (Edge){y, elast[x], z};
  elast[x] = ecnt;
}
inline void dfs_find(int u, int fa, int tot) {
  sz[u] = 1;
  ms[u] = 0;
  for (int i = elast[u]; i; i = e[i].prev) {
    int v = e[i].y;
    if (v != fa && !del[v]) {
      dfs_find(v, u, tot);
      sz[u] += sz[v];
      ms[u] = max(ms[u], sz[v]);
    }
  }
  ms[u] = max(ms[u], tot - sz[u]);
  rt = ms[u] * 2 <= tot ? u : rt;
}
inline void dfs_calc(int u, int fa, int d, double &f, double &g) {
  double tmp = sqrt((double)d) * w[u];
  f += tmp * d;
  g += tmp;
  for (int i = elast[u]; i; i = e[i].prev) {
    int v = e[i].y;
    if (v != fa) {
      dfs_calc(v, u, d + e[i].z, f, g);
    }
  }
}
inline void konjac(int u, int tot) {
  dfs_find(u, 0, tot);
  del[u = rt] = 1;
  double sum = 0, gsum = 0;
  for (int i = elast[u]; i; i = e[i].prev) {
    int v = e[i].y;
    f[v] = 0;
    dfs_calc(v, u, e[i].z, sum, f[v]);
    gsum += f[v];
  }
  if (ans > sum) {
    ans = sum;
    c = u;
  }
  for (int i = elast[u]; i; i = e[i].prev) {
    int v = e[i].y;
    if (!del[v] && gsum - f[v] - f[v] < 0) {
      konjac(v, sz[v] < sz[u] ? sz[v] : tot - sz[u]);
      return;
    }
  }
}
int main() {
  RI(n);
  for (int i = 1; i <= n; ++i) {
    RI(w[i]);
  }
  for (int i = 1; i < n; ++i) {
    int x, y, z;
    RI(x);
    RI(y);
    RI(z);
    Build(x, y, z);
    Build(y, x, z);
  }
  ans = 1e100;
  konjac(1, n);
  printf("%d %.6lf\n", c, ans);
  return 0;
}
