#include <bits/stdc++.h>
using namespace std;
const int N = 200003;
int n;
double w[N];
int cnt, head[N];
struct Edge {
  int nxt, to;
  double w;
} e[N << 1];
int S, num, rt, siz[N];
double sum, d[N];
double ans = 1e20;
int ans2;
bool v[N];
void add(int u, int v, double w) {
  e[++cnt] = (Edge){head[u], v, w}, head[u] = cnt;
}
void getrt(int x, int fa) {
  siz[x] = 1;
  int Max = 0;
  for (int i = head[x]; i; i = e[i].nxt) {
    int to = e[i].to;
    if (v[to] || to == fa) continue;
    getrt(to, x);
    siz[x] += siz[to], Max = max(Max, siz[to]);
  }
  Max = max(Max, S - siz[x]);
  if (Max < num) num = Max, rt = x;
}
void dfs(int x, int fa, double dis) {
  double t = sqrt(dis);
  sum += w[x] * t * dis, d[x] = w[x] * 1.5 * t;
  for (int i = head[x]; i; i = e[i].nxt) {
    int to = e[i].to;
    if (to == fa) continue;
    dfs(to, x, dis + e[i].w);
    d[x] += d[to];
  }
}
void solve(int x) {
  if (v[x]) return;
  v[x] = true;
  sum = 0;
  dfs(x, 0, 0);
  if (ans > sum) ans = sum, ans2 = x;
  for (int i = head[x]; i; i = e[i].nxt) {
    int to = e[i].to;
    if (d[x] - 2 * d[to] >= 0) continue;
    S = siz[to], num = 1e9, getrt(to, 0);
    solve(rt);
    break;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lf", &w[i]);
  for (int i = 1; i < n; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    add(u, v, w), add(v, u, w);
  }
  S = n, num = 1e9, getrt(1, 0);
  solve(rt);
  printf("%d %.12f", ans2, ans);
  return 0;
}
