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>
const int N = 200054, M = N * 2;
struct edge {
  int u, v, w;
  edge(int u0 = 0, int v0 = 0, int w0 = 0) : u(u0), v(v0), w(w0) {}
} e[M];
int n, E = 0;
int first[N], next[M];
int w[N], size[N];
double diff[N];
int ansC;
double cur, ansW = INFINITY;
bool fy[N];
inline bool up(int &x, const int y) { return x < y ? x = y, 1 : 0; }
inline bool up(double &x, const double y) { return x < y ? x = y, 1 : 0; }
inline void addedge(int u, int v, int w) {
  e[++E] = edge(u, v, w), next[E] = first[u], first[u] = E;
  e[++E] = edge(v, u, w), next[E] = first[v], first[v] = E;
}
namespace Centroid {
int V, Gm, G, size[N];
void init(int _V) { V = _V, Gm = INT_MAX; }
int get(int x, int px = 0) {
  int i, y, Max = 0;
  size[x] = 1;
  for (i = first[x]; i; i = next[i])
    if ((y = e[i].v) != px && !fy[y])
      get(y, x), up(Max, size[y]), size[x] += size[y];
  up(Max, V - size[x]);
  return Max <= Gm ? (Gm = Max, G = x) : G;
}
}  // namespace Centroid
void dfs(int x, int px = 0) {
  int i, y;
  size[x] = 1;
  for (i = first[x]; i; i = next[i])
    if ((y = e[i].v) != px && !fy[y]) dfs(y, x), size[x] += size[y];
}
void compute(int x, int px, int dep) {
  int i, y;
  cur += double((long long)w[x] * dep) * sqrt(dep);
  for (i = first[x]; i; i = next[i])
    if ((y = e[i].v) != px) compute(y, x, dep + e[i].w);
}
void compute_diff(int x, int px, int dep) {
  int i, y;
  diff[x] = w[x] * sqrt(dep);
  for (i = first[x]; i; i = next[i])
    if ((y = e[i].v) != px)
      compute_diff(y, x, dep + e[i].w), diff[x] += diff[y];
}
void solve(int x) {
  int i, y, z = 0, G;
  double max = -INFINITY;
  cur = 0., fy[x] = true, dfs(x);
  if (compute(x, 0, 0), cur < ansW) ansC = x, ansW = cur;
  for (i = first[x]; i; i = next[i])
    if (!fy[y = e[i].v])
      if (compute_diff(y, x, e[i].w), up(max, diff[y])) z = y;
  if (z) G = (Centroid::init(size[z]), Centroid::get(z)), solve(G);
}
int main() {
  int i, G, $1, $2, $3;
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) scanf("%d", w + i);
  for (i = 1; i < n; ++i) scanf("%d%d%d", &$1, &$2, &$3), addedge($1, $2, $3);
  G = (Centroid::init(n), Centroid::get(1)), solve(G);
  printf("%d %.12lg\n", ansC, ansW);
  return 0;
}
