#include <bits/stdc++.h>
using namespace std;
int n, tot, root, num, pos;
double t;
double ans = 1e100;
const int N = 200010;
int w[N], head[N], to[N << 1], nt[N << 1], len[N << 1], mx[N], siz[N], vis[N],
    dis[N];
double sum[N];
void add(int f, int t, int d) {
  to[++tot] = t;
  len[tot] = d;
  nt[tot] = head[f];
  head[f] = tot;
}
void Groot(int x, int fa) {
  siz[x] = 1;
  mx[x] = 0;
  for (int i = head[x]; i; i = nt[i])
    if (!vis[to[i]] && to[i] != fa) {
      Groot(to[i], x);
      siz[x] += siz[to[i]];
      mx[x] = max(mx[x], siz[to[i]]);
    }
  mx[x] = max(mx[x], num - siz[x]);
  if (mx[x] < mx[root]) root = x;
}
void dfs(int x, int fa) {
  sum[x] = 0;
  for (int i = head[x]; i; i = nt[i])
    if (to[i] != fa)
      dis[to[i]] = dis[x] + len[i], dfs(to[i], x), sum[x] += sum[to[i]];
  sum[x] += w[x] * sqrt(dis[x]);
  t += w[x] * pow(dis[x], 1.5);
}
void solve(int x) {
  vis[x] = 1;
  t = 0;
  for (int i = head[x]; i; i = nt[i])
    dis[to[i]] = len[i], dfs(to[i], x), sum[x] += sum[to[i]];
  if (t < ans) ans = t, pos = x;
  double tmp, mn = 1e100;
  int To = 0;
  for (int i = head[x]; i; i = nt[i])
    if (!vis[to[i]]) {
      tmp = (sum[x] - sum[to[i]]) - sum[to[i]];
      if (tmp < mn) mn = tmp, To = to[i];
    }
  if (To) root = 0, num = siz[To], Groot(To, 0), solve(root);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) scanf("%d", &w[i]);
  for (int i = 1, x, y, z; i < n; ++i)
    scanf("%d%d%d", &x, &y, &z), add(x, y, z), add(y, x, z);
  mx[0] = 1 << 30;
  root = 0;
  num = n;
  Groot(1, 0);
  solve(root);
  printf("%d %.10f", pos, ans);
  return 0;
}
