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 + 5;
int n, head[N], tot, w[N], ans1, rt, v[N], s[N];
double ans2 = 1e20, sum, sd, d[N];
struct node {
  int to, nex, val;
} a[N << 1];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
void add(int x, int y, int z) {
  a[++tot].to = y;
  a[tot].nex = head[x];
  head[x] = tot;
  a[tot].val = z;
}
void dfs(int x, int f, int S) {
  s[x] = 1;
  int o = 0;
  for (int i = head[x]; i; i = a[i].nex) {
    int y = a[i].to;
    if (v[y] || y == f) continue;
    dfs(y, x, S);
    s[x] += s[y];
    o = max(o, s[y]);
  }
  o = max(o, S - s[x]);
  if (o <= (S >> 1)) rt = x;
}
void calc(int x, int f, int o, int z) {
  sum += pow(z, 1.5) * w[x];
  d[o] += pow(z, 0.5) * 1.5 * w[x];
  for (int i = head[x]; i; i = a[i].nex) {
    int y = a[i].to;
    if (y == f) continue;
    calc(y, x, o, z + a[i].val);
  }
}
void dfs(int x, int S) {
  dfs(x, 0, S);
  x = rt;
  dfs(x, 0, S);
  if (v[x]) return;
  v[x] = 1;
  sum = sd = 0;
  for (int i = head[x]; i; i = a[i].nex) {
    int y = a[i].to;
    d[y] = 0;
    calc(y, x, y, a[i].val);
    sd += d[y];
  }
  if (sum < ans2) ans1 = x, ans2 = sum;
  for (int i = head[x]; i; i = a[i].nex) {
    int y = a[i].to;
    if (sd - d[y] * 2 >= 0) continue;
    dfs(y, s[y]);
    break;
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) w[i] = read();
  for (int i = 1, x, y, z; i <= n - 1; i++) {
    x = read();
    y = read();
    z = read();
    add(x, y, z);
    add(y, x, z);
  }
  dfs(1, n);
  printf("%d %.10f\n", ans1, ans2);
  fclose(stdin);
  fclose(stdout);
  return 0;
}
