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;
const int N = 4e5 + 5;
const long double eps = 1e-12;
struct edge {
  int to, len, nxt;
} e[N << 1];
int h[N], tot = 1, n, a[N], sz[N], rt, vis[N], mz, ak;
long double s1, s2, s3[N], ans = 1e100;
void adde(int x, int y, int z) {
  e[tot] = (edge){y, z, h[x]};
  h[x] = tot++;
}
void getsz(int u, int ff) {
  sz[u] = 1;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == ff || vis[v]) continue;
    getsz(v, u), sz[u] += sz[v];
  }
}
void getrt(int u, int ff) {
  sz[u] = 1;
  int mx = 0;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == ff || vis[v]) continue;
    getrt(v, u), sz[u] += sz[v];
    mx = max(mx, sz[v]);
  }
  mx = max(mx, mz - sz[u]);
  if (mx <= mz / 2) rt = u;
}
void getf(int u, int ff, int rr, int dep) {
  s1 += a[u] * pow(dep, 1.5), s2 += a[u] * sqrt(dep) * 1.5,
      s3[rr] += a[u] * sqrt(dep) * 1.5;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == ff) continue;
    getf(v, u, rr, dep + e[i].len);
  }
}
void dfs(int u) {
  s1 = 0, s2 = 0;
  vis[u] = 1;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    s3[v] = 0;
    getf(v, u, v, e[i].len);
  }
  if (ans > s1) ans = s1, ak = u;
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (vis[v] || s2 - s3[v] * 2 >= -eps) continue;
    getsz(v, u), mz = sz[v], getrt(v, u), dfs(rt);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i < n; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z), adde(x, y, z), adde(y, x, z);
  }
  mz = n, getrt(1, 0), dfs(rt);
  printf("%d %.10Lf\n", ak, ans);
}
