#include <bits/stdc++.h>
using namespace std;
const long long N = 400005;
long long ec = 0, to[N << 1], nxt[N << 1], ew[N << 1], hed[N];
void add_edge(long long f, long long t, long long cst) {
  ++ec;
  to[ec] = t;
  nxt[ec] = hed[f];
  hed[f] = ec;
  ew[ec] = cst;
}
long long n;
long long rt, tot, siz[N], dfz[N], mxd[N], w[N];
void find_rt(long long u, long long f) {
  siz[u] = 1;
  mxd[u] = 0;
  for (long long i = hed[u]; i; i = nxt[i]) {
    long long v = to[i];
    if (dfz[v] || v == f) continue;
    find_rt(v, u);
    siz[u] += siz[v];
    mxd[u] = max(mxd[u], siz[v]);
  }
  mxd[u] = max(tot - mxd[u], mxd[u]);
  if (mxd[u] < mxd[rt]) rt = u;
}
double sw[N], d[N];
long long dis[N];
void dfs_calc(long long u, long long f) {
  sw[u] = pow(dis[u], 1.5) * w[u];
  d[u] = pow(dis[u], 0.5) * 1.5 * w[u];
  for (long long i = hed[u]; i; i = nxt[i]) {
    long long v = to[i];
    if (v == f) continue;
    dis[v] = dis[u] + ew[i];
    dfs_calc(v, u);
    sw[u] += sw[v];
    d[u] += d[v];
  }
}
double ans = 1e177;
long long id = -1;
void solve(long long u) {
  double sd = 0.0, sum = 0.0;
  find_rt(u, 0);
  dfz[u] = 1;
  for (long long i = 1; i <= n; i++) d[i] = 0.0;
  sd = 0.0;
  dis[u] = 0;
  for (long long i = hed[u]; i; i = nxt[i]) {
    long long v = to[i];
    dis[v] = ew[i];
    dfs_calc(v, u);
    sd += d[v];
    sum += sw[v];
  }
  if (sum < ans) {
    id = u;
    ans = sum;
  }
  for (long long i = hed[u]; i; i = nxt[i]) {
    long long v = to[i];
    if (dfz[v]) continue;
    if (sd - 2.0 * d[v] < 0) {
      rt = 0;
      tot = siz[v];
      find_rt(v, u);
      solve(rt);
      break;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  long long tu, tv, tw;
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> w[i];
  for (long long i = 1; i < n; i++) {
    cin >> tu >> tv >> tw;
    add_edge(tu, tv, tw);
    add_edge(tv, tu, tw);
  }
  rt = 0;
  mxd[0] = n + 1;
  tot = n;
  find_rt(1, 0);
  solve(rt);
  printf("%lld %.10lf\n", id, ans);
  return 0;
}
