3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
template <typename _T>
inline void read(_T &f) {
  f = 0;
  _T fu = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') {
      fu = -1;
    }
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    f = (f << 3) + (f << 1) + (c & 15);
    c = getchar();
  }
  f *= fu;
}
template <typename T>
void print(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x < 10)
    putchar(x + 48);
  else
    print(x / 10), putchar(x % 10 + 48);
}
template <typename T>
void print(T x, char t) {
  print(x);
  putchar(t);
}
const int N = 2e5 + 5;
struct edge_t {
  int u, v, next, w;
} G[N << 1];
int head[N], a[N], siz[N], maxn[N], vis[N];
int n, tot, allsize, root;
inline void addedge(int u, int v, int w) {
  G[++tot] = (edge_t){u, v, head[u], w}, head[u] = tot;
}
void getroot(int u, int fa) {
  siz[u] = 1;
  maxn[u] = 0;
  for (int i = head[u]; i; i = G[i].next) {
    int v = G[i].v;
    if (vis[v] || v == fa) continue;
    getroot(v, u);
    siz[u] += siz[v];
    maxn[u] = max(maxn[u], siz[v]);
  }
  maxn[u] = max(maxn[u], allsize - siz[u]);
  if (maxn[u] < maxn[root]) root = u;
}
double getans(int u, int fa, int dis) {
  double ans = dis * sqrt(dis) * a[u];
  for (int i = head[u]; i; i = G[i].next) {
    int v = G[i].v;
    if (v == fa) continue;
    ans += getans(v, u, dis + G[i].w);
  }
  return ans;
}
double getdao(int u, int fa, int dis) {
  double ans = 1.5 * sqrt(dis) * a[u];
  for (int i = head[u]; i; i = G[i].next) {
    int v = G[i].v;
    if (v == fa) continue;
    ans += getdao(v, u, dis + G[i].w);
  }
  return ans;
}
int solve(int u) {
  vis[u] = 1;
  double maxn = -1;
  int id = 0;
  for (int i = head[u]; i; i = G[i].next) {
    int v = G[i].v;
    if (vis[v]) continue;
    double dao = getdao(v, u, G[i].w);
    if (dao > maxn) maxn = dao, id = v;
  }
  if (!id || getans(id, 0, 0) >= getans(u, 0, 0)) return u;
  if (siz[id] > siz[u])
    allsize -= siz[u];
  else
    allsize = siz[id];
  root = 0;
  getroot(id, u);
  return solve(root);
}
int main() {
  read(n);
  for (int i = 1; i <= n; i++) read(a[i]);
  for (int i = 1; i < n; i++) {
    int u, v, w;
    read(u);
    read(v);
    read(w);
    addedge(u, v, w);
    addedge(v, u, w);
  }
  maxn[0] = n + 1;
  allsize = n;
  root = 0;
  getroot(1, 0);
  int rt = solve(root);
  printf("%d %.10lf\n", rt, getans(rt, 0, 0));
  return 0;
}
