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>
inline int read() {
  int data = 0, w = 1;
  char ch = getchar();
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
  if (ch == '-') w = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
  return data * w;
}
const int N(2e5 + 10);
struct edge {
  int next, to, dis;
} e[N << 1];
int n, w[N], head[N], e_num, rt, Size, Min, size[N], vis[N], ansX;
inline void add_edge(int from, int to, int dis) {
  e[++e_num] = (edge){head[from], to, dis}, head[from] = e_num;
}
double d[N], sumd, sum, ansd;
void getRoot(int x, int fa) {
  size[x] = 1;
  int mx = 0;
  for (int i = head[x]; i; i = e[i].next) {
    int to = e[i].to;
    if (to == fa || vis[to]) continue;
    getRoot(to, x), size[x] += size[to], mx = std::max(mx, size[to]);
  }
  mx = std::max(mx, Size - size[x]);
  if (mx < Min) Min = mx, rt = x;
}
void getDis(int x, int fa, int t, int ds) {
  sum += std::pow(ds, 1.5) * w[x], d[t] += 1.5 * w[x] * std::sqrt(ds);
  for (int i = head[x]; i; i = e[i].next) {
    int to = e[i].to;
    if (to == fa) continue;
    getDis(to, x, t, ds + e[i].dis);
  }
}
void dfs(int x) {
  vis[x] = 1, sum = sumd = 0;
  for (int i = head[x]; i; i = e[i].next)
    d[e[i].to] = 0, getDis(e[i].to, x, e[i].to, e[i].dis), sumd += d[e[i].to];
  if (sum < ansd) ansd = sum, ansX = x;
  for (int i = head[x]; i; i = e[i].next) {
    int to = e[i].to;
    if (vis[to] || sumd - d[to] * 2. < 0) continue;
    Size = Min = size[to], rt = to, getRoot(to, x), dfs(rt);
    break;
  }
}
int main() {
  n = read(), ansd = 1e20;
  for (int i = 1; i <= n; i++) w[i] = read();
  for (int i = 1, a, b, c; i < n; i++)
    a = read(), b = read(), c = read(), add_edge(a, b, c), add_edge(b, a, c);
  Size = Min = n, getRoot(1, 0), dfs(rt);
  printf("%d %.10lf\n", ansX, ansd);
  return 0;
}
