#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  char ch = getchar();
  long long s = 0, w = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    s = s * 10 + ch - '0';
    ch = getchar();
  }
  return s * w;
}
int size[200010];
int vis[200010], rt;
struct edge {
  int next, to;
  double v;
} e[200010 << 1];
int head[200010], n, ans1, cnt;
double sum = 0, sumd = 0;
double d[200010], w[200010], ans2 = 1e100;
inline void add_edge(int from, int to, double v) {
  e[++cnt] = (edge){head[from], to, v};
  head[from] = cnt;
}
void dfs(int now, int father, int Ns) {
  int maxn = 0;
  size[now] = 1;
  for (register int i = head[now]; i; i = e[i].next) {
    if (e[i].to == father || vis[e[i].to]) continue;
    dfs(e[i].to, now, Ns);
    maxn = max(maxn, size[e[i].to]);
    size[now] += size[e[i].to];
  }
  maxn = max(maxn, Ns - size[now]);
  if (maxn * 2 <= Ns) {
    rt = now;
  }
}
void calc(int now, int father, int o, double dis) {
  sum += pow(dis, 1.5) * w[now];
  d[o] += 1.5 * pow(dis, 0.5) * w[now];
  for (register int i = head[now]; i; i = e[i].next) {
    if (e[i].to == father) continue;
    calc(e[i].to, now, o, dis + e[i].v);
  }
}
void dfs(int now, int Siz) {
  dfs(now, 0, Siz);
  now = rt;
  dfs(now, 0, Siz);
  if (vis[now]) return;
  vis[now] = 1;
  sum = sumd = 0;
  for (register int i = head[now]; i; i = e[i].next) {
    int to = e[i].to;
    d[to] = 0;
    calc(to, now, to, e[i].v);
    sumd += d[to];
  }
  if (sum < ans2) ans2 = sum, ans1 = now;
  for (register int i = head[now]; i; i = e[i].next) {
    if (sumd - d[e[i].to] * 2 < 0) {
      dfs(e[i].to, size[e[i].to]);
      break;
    }
  }
}
int main() {
  n = read();
  for (register int i = 1; i <= n; i++) w[i] = read();
  for (register int i = 1; i < n; i++) {
    int x = read(), y = read();
    double v = read();
    add_edge(x, y, v);
    add_edge(y, x, v);
  }
  dfs(1, n);
  printf("%d %.10lf\n", ans1, ans2);
  return 0;
}
