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>
const int P = 998244353;
using namespace std;
template <typename T>
inline void ckmax(T &a, T b) {
  (a < b) && (a = b);
}
template <typename T>
inline void ckmin(T &a, T b) {
  (a > b) && (a = b);
}
inline int mul(int a, int b) { return 1ll * a * b % P; }
inline int add(int a, int b) { return a + b >= P ? a + b - P : a + b; }
inline int sub(int a, int b) { return a - b >= 0 ? a - b : a - b + P; }
inline void mulmod(int &a, int b) { a = mul(a, b); }
inline void addmod(int &a, int b) { ((a += b) >= P) && (a -= P); }
inline void submod(int &a, int b) { ((a -= b) < 0) && (a += P); }
inline int ksm(int a, int b) {
  int ans = 1;
  for (; b; b >>= 1) {
    if (b & 1) ans = 1ll * ans * a % P;
    a = 1ll * a * a % P;
  }
  return ans;
}
inline int inv(int a) { return ksm(a, P - 2); }
namespace FastIO {
const int SIZE = 1 << 16;
char buf[SIZE], obuf[SIZE], str[64];
int bi = SIZE, bn = SIZE, opt;
int read(char *s) {
  while (bn) {
    for (; bi < bn && buf[bi] <= ' '; bi++)
      ;
    if (bi < bn) break;
    bn = fread(buf, 1, SIZE, stdin), bi = 0;
  }
  int sn = 0;
  while (bn) {
    for (; bi < bn && buf[bi] > ' '; bi++) s[sn++] = buf[bi];
    if (bi < bn) break;
    bn = fread(buf, 1, SIZE, stdin), bi = 0;
  }
  s[sn] = 0;
  return sn;
}
bool read(int &x) {
  if (x) x = 0;
  int bf = 0, n = read(str);
  if (!n) return 0;
  int i = 0;
  if (str[i] == '-') bf = 1, i = 1;
  for (x = 0; i < n; i++) x = x * 10 + str[i] - '0';
  if (bf) x = -x;
  return 1;
}
void write(int x) {
  if (!x)
    obuf[opt++] = '0';
  else {
    if (x < 0) obuf[opt++] = '-', x = -x;
    int sn = 0;
    while (x) str[sn++] = x % 10 + '0', x /= 10;
    for (int i = sn - 1; i >= 0; i--) obuf[opt++] = str[i];
  }
  if (opt >= (SIZE >> 1)) {
    fwrite(obuf, 1, opt, stdout);
    opt = 0;
  }
}
void write(char x) {
  obuf[opt++] = x;
  if (opt >= (SIZE >> 1)) {
    fwrite(obuf, 1, opt, stdout);
    opt = 0;
  }
}
void Fflush() {
  if (opt) fwrite(obuf, 1, opt, stdout);
  opt = 0;
}
};  // namespace FastIO
inline int read() {
  int x;
  FastIO::read(x);
  return x;
}
const int MN = 2e5 + 5;
int a[MN], n, vis[MN];
vector<pair<int, int> > e[MN];
int vrt, rt, siz[MN];
void getroot(int u, int fa, int allsiz) {
  int mx = 0;
  siz[u] = 1;
  for (auto it : e[u]) {
    int v = it.first;
    if (vis[v] || v == fa) continue;
    getroot(v, u, allsiz);
    siz[u] += siz[v];
    ckmax(mx, siz[v]);
  }
  ckmax(mx, allsiz - siz[u]);
  if (mx < vrt) vrt = mx, rt = u;
}
int p[MN], ar;
double ans = -1, v1, v2, f[MN];
void getp(int u, int fa, int st, int dep) {
  v1 += a[u] * pow(dep, 1.5);
  v2 += a[u] * sqrt(dep), f[st] += a[u] * sqrt(dep);
  for (auto it : e[u]) {
    int v = it.first;
    if (v == fa) continue;
    getp(v, u, st, dep + it.second);
  }
}
void dfs(int u, int allsiz) {
  vis[u] = 1, v1 = v2 = 0;
  for (auto it : e[u]) {
    int v = it.first;
    f[v] = 0;
    getp(v, u, v, it.second);
  }
  if (ans == -1 || v1 < ans) ans = v1, ar = u;
  for (auto it : e[u]) {
    int v = it.first;
    if (vis[v]) continue;
    if (v2 - 2 * f[v] < 0) {
      int tsiz = siz[u] < siz[v] ? allsiz - siz[v] : siz[v];
      vrt = ((1 << 30) - 1);
      getroot(v, 0, tsiz);
      dfs(rt, tsiz);
      break;
    }
  }
}
int main() {
  n = read();
  for (int i = (1); i <= (n); i++) a[i] = read();
  for (int i = (1); i <= (n - 1); i++) {
    int u = read(), v = read(), w = read();
    e[u].push_back(make_pair(v, w)), e[v].push_back(make_pair(u, w));
  }
  vrt = ((1 << 30) - 1);
  getroot(1, 0, n);
  dfs(rt, n);
  printf("%d %.15lf\n", ar, ans);
  return FastIO::Fflush(), 0;
}
