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>
template <class T1, class T2>
inline bool cmin(T1 &a, const T2 &b) {
  return b < a ? (a = b, true) : false;
}
template <class T1, class T2>
inline bool cmax(T1 &a, const T2 &b) {
  return a < b ? (a = b, true) : false;
}
template <class Type>
Type read() {
  Type a;
  bool b;
  unsigned char c;
  while (c = getchar() - 48, (c > 9) & (c != 253))
    ;
  for (a = (b = c == 253) ? 0 : c; (c = getchar() - 48) <= 9; a = a * 10 + c)
    ;
  return b ? -a : a;
}
auto rd = read<int>;
const int N = 2e5 + 1;
bool vis[N];
int n, w[N], to[2 * N], l[N], head[N], next[2 * N], size[N], cho;
double f[N], ans, lagoon;
std::vector<int> sub;
void measure(int u) {
  vis[u] = true;
  sub.push_back(u);
  size[u] = 1;
  for (int i = head[u]; i; i = next[i])
    if (!vis[to[i]]) {
      measure(to[i]);
      size[u] += size[to[i]];
    }
  vis[u] = false;
}
void sol(int u, int p, double pinkrabbit) {
  f[u] = sqrt(pinkrabbit) * w[u];
  lagoon += pinkrabbit * f[u];
  for (int i = head[u]; i; i = next[i])
    if (to[i] != p) {
      sol(to[i], u, pinkrabbit + l[i >> 1]);
      f[u] += f[to[i]];
    }
}
void bin(int in) {
  int g;
  sub.clear();
  measure(in);
  for (int i = 0; i < sub.size(); ++i) {
    g = sub[i];
    bool ok = size[g] * 2 >= size[in];
    for (int j = head[g]; j && ok; j = next[j])
      ok &= vis[to[j]] || size[to[j]] >= size[g] || size[to[j]] * 2 <= size[in];
    if (ok) break;
  }
  lagoon = 0;
  sol(g, 0, 0);
  if (cmin(ans, lagoon)) cho = g;
  vis[g] = true;
  for (int i = head[g]; i; i = next[i])
    if (2 * f[to[i]] > f[g]) {
      if (!vis[to[i]]) bin(to[i]);
      return;
    }
}
int main() {
  n = rd();
  for (int i = 1; i <= n; ++i) w[i] = rd();
  for (int i = 1, j = 2; i < n; ++i) {
    int u = rd(), v = rd();
    l[i] = rd();
    to[j] = v, next[j] = head[u], head[u] = j++;
    to[j] = u, next[j] = head[v], head[v] = j++;
  }
  ans = 1e100;
  bin(1);
  printf("%d %.15lf\n", cho, ans);
  return 0;
}
