#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int gi() {
  int x = 0, o = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
struct edge {
  int to, w, nxt;
} e[N << 1];
int tot = 0, h[N];
void adde(int u, int v, int w) {
  e[++tot] = (edge){v, w, h[u]};
  h[u] = tot;
  e[++tot] = (edge){u, w, h[v]};
  h[v] = tot;
}
int n, w[N], p = 0;
int siz[N], f[N], sz, rt;
bool vis[N];
double dao, sum, ans = 1e300;
void dfs1(int u, int fa) {
  siz[u] = 1;
  f[u] = 0;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fa || vis[v]) continue;
    dfs1(v, u);
    siz[u] += siz[v];
    f[u] = max(f[u], siz[v]);
  }
  f[u] = max(f[u], sz - siz[u]);
  if (f[u] < f[rt]) rt = u;
}
void dfs2(int u, int fa, long long dis) {
  sum += 1.0 * dis * sqrt(dis) * w[u];
  dao += 1.5 * sqrt(dis) * w[u];
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == fa) continue;
    dfs2(v, u, dis + e[i].w);
  }
}
void solve(int u) {
  dfs1(u, 0);
  sz = siz[u], rt = 0;
  dfs1(u, 0);
  u = rt;
  vis[u] = 1;
  sum = 0;
  double mx = -1e300;
  int t = u;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    dao = 0;
    dfs2(v, u, e[i].w);
    if (dao > mx) mx = dao, t = v;
  }
  if (sum < ans) ans = sum, p = u;
  if (!vis[t]) solve(t);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) w[i] = gi();
  for (int i = 1, u, v, w; i < n; i++)
    u = gi(), v = gi(), w = gi(), adde(u, v, w);
  f[0] = n;
  solve(1);
  printf("%d %.6lf\n", p, ans);
  return 0;
}
