#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool flag = false;
  while (!isdigit(c)) {
    if (c == '-') flag = true;
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  if (flag) x = -x;
}
int n, tot, root, pos;
double ans, sum, val;
int w[400010], siz[400010], mx[400010];
double s[400010];
bool vis[400010];
struct edge {
  int to, nxt, v;
} e[400010];
int head[400010], edge_cnt;
void add(int from, int to, int val) {
  e[++edge_cnt] = {to, head[from], val}, head[from] = edge_cnt;
}
void dfs_root(int x, int fa) {
  siz[x] = 1, mx[x] = 0;
  for (int i = head[x]; i; i = e[i].nxt) {
    int y = e[i].to;
    if (vis[y] || y == fa) continue;
    dfs_root(y, x), siz[x] += siz[y];
    mx[x] = max(mx[x], siz[y]);
  }
  mx[x] = max(mx[x], tot - siz[x]);
  if (mx[x] < mx[root]) root = x;
}
void dfs_calc(int x, int fa, int dis, int rt) {
  val += sqrt(dis) * dis * w[x], s[rt] += sqrt(dis) * w[x];
  for (int i = head[x]; i; i = e[i].nxt) {
    int y = e[i].to;
    if (y == fa) continue;
    dfs_calc(y, x, dis + e[i].v, rt);
  }
}
void solve(int x) {
  vis[x] = true, val = sum = 0;
  for (int i = head[x]; i; i = e[i].nxt) {
    int y = e[i].to;
    s[y] = 0, dfs_calc(y, x, e[i].v, y), sum += s[y];
  }
  if (val < ans || !pos) ans = val, pos = x;
  for (int i = head[x]; i; i = e[i].nxt) {
    int y = e[i].to;
    if (vis[y]) continue;
    if (sum - 2 * s[y] <= 0) {
      root = 0, tot = siz[y], dfs_root(y, x), solve(root);
      break;
    }
  }
}
int main() {
  read(n);
  for (int i = 1; i <= n; ++i) read(w[i]);
  for (int i = 1; i < n; ++i) {
    int x, y, v;
    read(x), read(y), read(v);
    add(x, y, v), add(y, x, v);
  }
  tot = mx[0] = n, dfs_root(1, 0), solve(root);
  printf("%d %.10lf", pos, ans);
  return 0;
}
