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 = 200003;
int n;
double w[N];
int cnt, head[N];
struct Edge {
  int nxt, to;
  double w;
} e[N << 1];
int S, num, rt, siz[N];
double sum, d[N];
double ans = 1e20;
int ans2;
bool v[N];
void add(int u, int v, double w) {
  e[++cnt] = (Edge){head[u], v, w}, head[u] = cnt;
}
void getrt(int x, int fa) {
  siz[x] = 1;
  int Max = 0;
  for (int i = head[x]; i; i = e[i].nxt) {
    int to = e[i].to;
    if (v[to] || to == fa) continue;
    getrt(to, x);
    siz[x] += siz[to], Max = max(Max, siz[to]);
  }
  Max = max(Max, S - siz[x]);
  if (Max < num) num = Max, rt = x;
}
void dfs(int x, int fa, double dis) {
  double t = sqrt(dis);
  sum += w[x] * t * dis, d[x] = w[x] * 1.5 * t;
  for (int i = head[x]; i; i = e[i].nxt) {
    int to = e[i].to;
    if (to == fa) continue;
    dfs(to, x, dis + e[i].w);
    d[x] += d[to];
  }
}
void solve(int x) {
  if (v[x]) return;
  v[x] = true;
  sum = 0;
  dfs(x, 0, 0);
  if (ans > sum) ans = sum, ans2 = x;
  for (int i = head[x]; i; i = e[i].nxt) {
    int to = e[i].to;
    if (d[x] - 2 * d[to] >= 0) continue;
    S = siz[to], num = 1e9, getrt(to, 0);
    solve(rt);
    break;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lf", &w[i]);
  for (int i = 1; i < n; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    add(u, v, w), add(v, u, w);
  }
  S = n, num = 1e9, getrt(1, 0);
  solve(rt);
  printf("%d %.12f", ans2, ans);
  return 0;
}
