#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
const long double eps = 1e-12;
struct edge {
  int to, len, nxt;
} e[N << 1];
int h[N], tot = 1, n, a[N], sz[N], rt, vis[N], mz, ak;
long double s1, s2, s3[N], ans = 1e100;
void adde(int x, int y, int z) {
  e[tot] = (edge){y, z, h[x]};
  h[x] = tot++;
}
void getsz(int u, int ff) {
  sz[u] = 1;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == ff || vis[v]) continue;
    getsz(v, u), sz[u] += sz[v];
  }
}
void getrt(int u, int ff) {
  sz[u] = 1;
  int mx = 0;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == ff || vis[v]) continue;
    getrt(v, u), sz[u] += sz[v];
    mx = max(mx, sz[v]);
  }
  mx = max(mx, mz - sz[u]);
  if (mx <= mz / 2) rt = u;
}
void getf(int u, int ff, int rr, int dep) {
  s1 += a[u] * pow(dep, 1.5), s2 += a[u] * sqrt(dep) * 1.5,
      s3[rr] += a[u] * sqrt(dep) * 1.5;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == ff) continue;
    getf(v, u, rr, dep + e[i].len);
  }
}
void dfs(int u) {
  s1 = 0, s2 = 0;
  vis[u] = 1;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    s3[v] = 0;
    getf(v, u, v, e[i].len);
  }
  if (ans > s1) ans = s1, ak = u;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (vis[v] || s2 - s3[v] * 2 >= -eps) continue;
    getsz(v, u), mz = sz[v], getrt(v, u), dfs(rt);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i < n; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z), adde(x, y, z), adde(y, x, z);
  }
  mz = n, getrt(1, 0), dfs(rt);
  printf("%d %.10Lf\n", ak, ans);
}
