#include <bits/stdc++.h>
using namespace std;
template <typename tp>
inline void read(tp &x) {
  x = 0;
  char c = getchar();
  int f = 0;
  for (; c < '0' || c > '9'; f |= c == '-', c = getchar())
    ;
  for (; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0', c = getchar())
    ;
  if (f) x = -x;
}
const int N = 3e5 + 233;
struct E {
  int nxt, to, w;
} e[N << 2];
int head[N], e_cnt = 0;
int sz[N], f[N], vis[N], root, all, a[N];
double s[N], s2[N], dep[N];
pair<double, int> ans;
int n, m;
inline void adde(int x, int y, int w) {
  e[++e_cnt] = (E){head[x], y, w};
  head[x] = e_cnt;
}
inline void frt(int u, int fat) {
  sz[u] = 1;
  f[u] = 0;
  for (register int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (vis[v] || v == fat) continue;
    frt(v, u);
    sz[u] += sz[v];
    f[u] = max(f[u], sz[v]);
  }
  f[u] = max(f[u], all - sz[u]);
  if (!root || f[root] > f[u]) root = u;
}
inline void fsz(int u, int fat) {
  sz[u] = 1;
  for (register int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (vis[v] || v == fat) continue;
    fsz(v, u);
    sz[u] += sz[v];
  }
}
inline void init() {
  memset(s, 0, sizeof s);
  memset(s2, 0, sizeof s2);
  memset(dep, 0, sizeof dep);
}
inline void dfs(int u, int fat) {
  s[u] = a[u] * pow(dep[u], 3. / 2);
  s2[u] = a[u] * 3. / 2 * pow(dep[u], 1. / 2);
  for (register int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fat) continue;
    dep[v] = dep[u] + e[i].w;
    dfs(v, u);
    s[u] += s[v];
    s2[u] += s2[v];
  }
}
inline void work(int u, int fat) {
  vis[u] = true;
  init();
  dfs(u, 0);
  ans = min(ans, make_pair(s[u], u));
  int nxt = -1;
  for (register int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fat || vis[v]) continue;
    if (nxt == -1 || s2[nxt] < s2[v]) nxt = v;
  }
  if (nxt == -1) return;
  fsz(nxt, u);
  all = sz[nxt];
  frt(nxt, root = 0);
  work(root, u);
}
int main(void) {
  read(n);
  ans = make_pair(1e99, 0);
  for (register int i = 1; i <= (n); i++) read(a[i]);
  for (register int i = 1; i <= (n - 1); i++) {
    int x, y, w;
    read(x), read(y), read(w);
    adde(x, y, w);
    adde(y, x, w);
  }
  all = n;
  frt(1, 0);
  work(root, 0);
  printf("%d %.10lf\n", ans.second, ans.first);
}
