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;
int n, ans1;
int head[200010], nex[200010 << 1], to[200010 << 1], size;
double wei[200010 << 1], w[200010], d[200010];
double ans2, sum;
int sz[200010], S, rt, mi;
bool vis[200010];
void add(int x, int y, int z) {
  to[++size] = y;
  nex[size] = head[x];
  wei[size] = z;
  head[x] = size;
}
void get_sz(int u, int fa) {
  sz[u] = 1;
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    if (v == fa || vis[u]) continue;
    get_sz(v, u);
    sz[u] += sz[v];
  }
}
void get_rt(int u, int fa) {
  int ma = 0;
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    if (vis[v] || fa == v) continue;
    get_rt(v, u);
    ma = max(ma, sz[v]);
  }
  ma = max(ma, S - sz[u]);
  if (ma < mi) mi = ma, rt = u;
}
void cal(int u, int fa, double dis) {
  sum += sqrt(dis * dis * dis) * w[u];
  d[u] = sqrt(dis * dis * dis) * w[u];
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    if (v == fa) continue;
    cal(v, u, dis + wei[i]);
    d[u] += d[v];
  }
}
void dfs(int u, int fa) {
  get_sz(u, fa);
  S = sz[u];
  mi = 1e9;
  get_rt(u, fa);
  if (vis[rt]) return;
  vis[rt] = 1;
  sum = 0;
  d[rt] = 0;
  for (int i = head[rt]; i; i = nex[i]) {
    int v = to[i];
    cal(v, rt, wei[i]);
    d[rt] += d[v];
  }
  if (ans2 - sum >= 1e-18) ans2 = sum, ans1 = rt;
  for (int i = head[rt]; i; i = nex[i]) {
    int v = to[i];
    if (d[rt] - 2.0 * d[v] < 0) {
      dfs(v, rt);
      return;
    }
  }
}
int main() {
  cin >> n;
  if (n == 1) {
    printf("1 0\n");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%lf", &w[i]);
  }
  int u, v, l;
  for (int i = 1; i < n; i++) {
    scanf("%d%d%d", &u, &v, &l);
    add(u, v, l);
    add(v, u, l);
  }
  ans2 = 1e42;
  dfs(1, 1);
  printf("%d %.7lf\n", ans1, ans2);
}
