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 i64 = long long;
constexpr int maxn = 200000;
constexpr int inf = 2147483647;
template <class _Tp>
inline void chkMax(_Tp &x, const _Tp y) {
  (x < y) && (x = y);
}
template <class _Tp>
inline bool bchkMin(_Tp &x, const _Tp y) {
  return (x > y) && (x = y, true);
}
namespace IOManager {
constexpr int FILESZ = 131072;
char buf[FILESZ];
const char *ibuf = buf, *tbuf = buf;
struct IOManager {
  inline char gc() {
    return (ibuf == tbuf) &&
                   (tbuf = (ibuf = buf) + fread(buf, 1, FILESZ, stdin),
                    ibuf == tbuf)
               ? EOF
               : *ibuf++;
  }
  template <class _Tp>
  inline operator _Tp() {
    _Tp s = 0u;
    char c = gc();
    for (; c < 48; c = gc())
      ;
    for (; c > 47; c = gc()) s = (_Tp)(s * 10u + c - 48u);
    return s;
  }
};
}  // namespace IOManager
IOManager::IOManager io;
struct Edge {
  int v, w;
  Edge *las;
  inline Edge *init(const int to, const int val, Edge *const ls) {
    return v = to, w = val, las = ls, this;
  }
} * las[maxn + 1];
inline void lnk() {
  static Edge pool[maxn << 1], *alc = pool - 1;
  const int u = io, v = io, w = io;
  las[u] = (++alc)->init(v, w, las[u]);
  las[v] = (++alc)->init(u, w, las[v]);
}
int w[maxn + 1], sz[maxn + 1], totalsz, mxsz, root;
std::bitset<maxn + 1> vis;
void precalc(const int u, const int fa) {
  sz[u] = 1;
  for (Edge *o = las[u]; o; o = o->las)
    if (!vis[o->v] && o->v != fa) {
      precalc(o->v, u);
      sz[u] += sz[o->v];
    }
  int mx = totalsz - sz[u];
  for (Edge *o = las[u]; o; o = o->las)
    if (!vis[o->v] && o->v != fa) chkMax(mx, sz[o->v]);
  if (bchkMin(mxsz, mx)) root = u;
}
int src, dep;
double sum, dsum, d[maxn + 1];
void calc(const int u, const int fa) {
  const double sqrtdep = sqrt((double)dep);
  sum += dep * sqrtdep * w[u];
  d[src] += 1.5 * sqrtdep * w[u];
  for (Edge *o = las[u]; o; o = o->las)
    if (o->v != fa) dep += o->w, calc(o->v, u), dep -= o->w;
}
int pos;
double minsum;
void calc(const int u) {
  if (vis[u]) return;
  vis[u] = true;
  sum = dsum = 0;
  for (Edge *o = las[u]; o; o = o->las)
    d[o->v] = 0, src = o->v, dep = o->w, calc(o->v, u), dsum += d[o->v];
  if (bchkMin(minsum, sum)) pos = u;
  for (Edge *o = las[u]; o; o = o->las)
    if (dsum < d[o->v] + d[o->v]) {
      totalsz = sz[o->v];
      mxsz = inf;
      precalc(o->v, 0);
      return calc(root);
    }
}
int main() {
  const int n = io;
  for (int i = 1; i <= n; ++i) w[i] = io;
  for (int i = n - 1; i != 0; --i) lnk();
  minsum = 1e20;
  totalsz = n;
  mxsz = inf;
  precalc(1, 0);
  precalc(root, 0);
  calc(root);
  printf("%d %.15lf", pos, minsum);
  return 0;
}
