#include <bits/stdc++.h>
using namespace std;
namespace Fread {
const int MAXN = 1 << 20;
char buf[MAXN], *S, *T;
inline char getchar() {
  if (S == T) {
    T = (S = buf) + fread(buf, 1, MAXN, stdin);
    if (S == T) return EOF;
  }
  return *S++;
}
}  // namespace Fread
inline int read() {
  int f = 1, x = 0;
  char ch = Fread::getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = Fread::getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = Fread::getchar();
  }
  return x * f;
}
inline long long readll() {
  long long f = 1, x = 0;
  char ch = Fread::getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = Fread::getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = Fread::getchar();
  }
  return x * f;
}
const int MAXN = 2e5;
struct EDGE {
  int nxt, to, w;
} edge[MAXN * 2 + 5];
int n, head[MAXN + 5], tot;
inline void add_edge(int u, int v, int w) {
  edge[++tot].nxt = head[u], edge[tot].to = v, edge[tot].w = w, head[u] = tot;
}
bool vis[MAXN + 5];
int SZ, rt, sz[MAXN + 5], mxs[MAXN + 5];
void _get_root(int u, int fa) {
  sz[u] = 1;
  mxs[u] = 0;
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (v == fa || vis[v]) continue;
    _get_root(v, u);
    sz[u] += sz[v];
    mxs[u] = max(mxs[u], sz[v]);
  }
  mxs[u] = max(mxs[u], SZ - sz[u]);
  if (!rt || mxs[u] < mxs[rt]) rt = u;
}
void get_root(int fullsize, int temproot) {
  rt = 0;
  SZ = fullsize;
  _get_root(temproot, 0);
}
long double w[MAXN + 5], f[MAXN + 5], g[MAXN + 5];
void dfs(int u, int fa, long long dis, long double *f) {
  f[u] = pow(dis, 1.5) * w[u];
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (v == fa) continue;
    dfs(v, u, dis + edge[i].w, f);
    f[u] += f[v];
  }
}
pair<long double, int> solve(int u) {
  vis[u] = 1;
  dfs(u, 0, 0, f);
  long double x = f[u];
  pair<long double, int> res = make_pair(x, u);
  dfs(u, 0, -1, g);
  dfs(u, 0, 1, f);
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (vis[v]) continue;
    long double y = g[v] + f[u] - f[v];
    if (y < x) {
      get_root(sz[v], v);
      pair<long double, int> res_v = solve(rt);
      res = min(res, res_v);
      return res;
    }
  }
  return res;
}
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) w[i] = read();
  for (int i = 1, u, v, w; i < n; ++i)
    u = read(), v = read(), w = read(), add_edge(u, v, w), add_edge(v, u, w);
  get_root(n, 1);
  pair<long double, int> res = solve(rt);
  cout << res.second << " " << setiosflags(ios::fixed) << setprecision(10)
       << res.first << endl;
  return 0;
}
