#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
struct edge {
  int ne, to, w;
  edge(int N = 0, int T = 0, int W = 0) : ne(N), to(T), w(W) {}
} e[MAXN << 1];
int fir[MAXN], num = 0;
inline void join(int a, int b, int c) {
  e[++num] = edge(fir[a], b, c);
  fir[a] = num;
}
int n, a[MAXN];
int siz[MAXN], maxp[MAXN], root;
bool vis[MAXN];
void fdRoot(int u, int fa, const int tots) {
  siz[u] = 1;
  maxp[u] = 0;
  for (int i = fir[u]; i; i = e[i].ne) {
    int v = e[i].to;
    if (v == fa || vis[v]) continue;
    fdRoot(v, u, tots);
    siz[u] += siz[v];
    maxp[u] = max(maxp[u], siz[v]);
  }
  maxp[u] = max(maxp[u], tots - siz[u]);
  if (!root || maxp[u] < maxp[root]) root = u;
}
double f[MAXN], sum, ansval, ns;
int ansid;
void calc(int u, int fa, int d, const int rt) {
  f[rt] += 3.0 / 2.0 * a[u] * sqrt(d);
  sum += 1.0 * a[u] * d * sqrt(d);
  for (int i = fir[u]; i; i = e[i].ne) {
    int v = e[i].to;
    if (v == fa) continue;
    calc(v, u, d + e[i].w, rt);
  }
}
void dfs(int u) {
  vis[u] = 1;
  sum = ns = 0;
  for (int i = fir[u]; i; i = e[i].ne) {
    int v = e[i].to;
    f[v] = 0;
    calc(v, u, e[i].w, v);
    ns += f[v];
  }
  if (ansval > sum) ansid = u, ansval = sum;
  for (int i = fir[u]; i; i = e[i].ne) {
    int v = e[i].to;
    if (vis[v]) continue;
    if (ns < f[v] * 2) {
      root = 0;
      fdRoot(v, u, siz[v]);
      dfs(root);
      break;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  for (int i = 1; i < n; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    join(u, v, w);
    join(v, u, w);
  }
  ansval = 1e21;
  root = 0;
  fdRoot(1, 0, n);
  dfs(root);
  printf("%d %.7lf\n", ansid, ansval);
  return 0;
}
