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 = 2e5 + 10;
int n, w[N], ht = 0, hd[N], ans1;
struct edge {
  int v, w, n;
} e[N * 2];
void addedge(int u, int v, int w) {
  e[++ht] = (edge){v, w, hd[u]};
  hd[u] = ht;
}
double ans2 = 1e20, sum, d[N], sd;
int s[N], rt, rts = N, vis[N];
void getrt(int u, int F, int S) {
  s[u] = 1;
  int us = 0;
  for (int i = hd[u], v; i; i = e[i].n) {
    v = e[i].v;
    if (vis[v] || v == F) continue;
    getrt(v, u, S), s[u] += s[v];
    us = max(us, s[v]);
  }
  us = max(us, S - s[u]);
  if (us < rts) rt = u, rts = us;
}
void calc(int u, int F, int z) {
  sum += pow(z, 1.5) * w[u];
  d[u] = pow(z, 0.5) * 1.5 * w[u];
  for (int i = hd[u], v; i; i = e[i].n) {
    v = e[i].v;
    if (v == F) continue;
    calc(v, u, z + e[i].w), d[u] += d[v];
  }
}
void work(int x, int S) {
  getrt(x, 0, S);
  getrt(x = rt, 0, S);
  vis[x] = 1, sum = sd = 0;
  for (int i = hd[x]; i; i = e[i].n) {
    calc(e[i].v, x, e[i].w);
    sd += d[e[i].v];
  }
  if (sum < ans2) ans1 = x, ans2 = sum;
  for (int i = hd[x]; i; i = e[i].n) {
    if (vis[e[i].v]) continue;
    if (sd - d[e[i].v] * 2 >= 0) continue;
    work(e[i].v, s[e[i].v]);
    break;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1, u, v, w; i < n; i++) {
    scanf("%d%d%d", &u, &v, &w);
    addedge(u, v, w), addedge(v, u, w);
  }
  work(1, n);
  printf("%d %.10lf\n", ans1, ans2);
  return 0;
}
