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 <class T>
inline void rd(T &x) {
  x = 0;
  char c = getchar();
  int f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) x = x * 10 - '0' + c, c = getchar();
  x *= f;
}
const int N = 2e5 + 10;
int head[N], ecnt, n;
struct ed {
  int to, next, w;
} e[N << 1];
void ad(int x, int y, int w) {
  e[++ecnt] = (ed){y, head[x], w};
  head[x] = ecnt;
  e[++ecnt] = (ed){x, head[y], w};
  head[y] = ecnt;
}
int vis[N];
int dis[N], wi[N];
double sum[N], tot, ans = 1e18;
int ansp;
void dfs(int u, int last) {
  sum[u] = 0;
  for (int k = head[u]; k; k = e[k].next) {
    int v = e[k].to;
    if (v == last) continue;
    dis[v] = dis[u] + e[k].w, dfs(v, u);
    sum[u] += sum[v];
  }
  sum[u] += wi[u] * sqrt(dis[u]);
  tot += wi[u] * pow(dis[u], 1.5);
}
int mi, siz, rt;
int sz[N];
void getrt(int u, int last) {
  sz[u] = 1;
  int mx = 0;
  for (int k = head[u]; k; k = e[k].next) {
    int v = e[k].to;
    if (v == last || vis[v]) continue;
    getrt(v, u), sz[u] += sz[v], mx = max(mx, sz[v]);
  }
  mx = max(mx, siz - sz[u]);
  if (mx < mi) mi = mx, rt = u;
}
void sol(int u) {
  vis[u] = 1, tot = 0;
  for (int k = head[u]; k; k = e[k].next) {
    int v = e[k].to;
    dis[v] = e[k].w, dfs(v, u);
    sum[u] += sum[v];
  }
  if (tot < ans) ans = tot, ansp = u;
  double _mi = 1e18;
  int p = 0;
  for (int k = head[u]; k; k = e[k].next) {
    int v = e[k].to;
    if (vis[v]) continue;
    double tmp = (sum[u] - sum[v]) - sum[v];
    if (tmp < _mi) _mi = tmp, p = v;
  }
  if (p) mi = 1e9, siz = sz[p], getrt(p, u), sol(rt);
}
int main() {
  rd(n);
  for (int i = 1; i <= n; ++i) rd(wi[i]);
  for (int i = 1, x, y, w; i < n; ++i) rd(x), rd(y), rd(w), ad(x, y, w);
  mi = 1e9, siz = n, getrt(1, 0), sol(rt);
  printf("%d %.10lf", ansp, ans);
  return 0;
}
