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 = 200005;
using namespace std;
int n, a[N], to[N * 2], hd[N * 2], ln[N * 2], lk[N], cnt, sz[N], fi;
double co[N], now, sum, upd, ans = 1e18, tp;
bool vis[N];
int u, v, w;
inline void add(int u, int v) {
  to[++cnt] = v, hd[cnt] = lk[u], ln[cnt] = w, lk[u] = cnt;
}
int get(int x, int y, int nn) {
  for (int s, i = lk[x]; i; i = hd[i])
    if (!vis[s = to[i]])
      if (s ^ y && sz[s] > nn) return get(s, x, nn);
  return x;
}
bool fl = 1;
void dfs(int x, int y, long long d) {
  tp = a[x] * sqrt((double)d);
  now += tp, upd += d * tp;
  sz[x] = 1;
  for (int s, i = lk[x]; i; i = hd[i])
    if ((s = to[i]) ^ y) dfs(s, x, d + ln[i]), sz[x] += sz[s];
  if (vis[x]) sz[x] = 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  for (int i = 1; i < n; i++) scanf("%d%d%d", &u, &v, &w), add(u, v), add(v, u);
  dfs(1, 0, 0);
  ;
  for (int x = 1; fl;) {
    vis[x = get(x, 0, sz[x] >> 1)] = 1, sum = upd = fl = 0;
    for (int s, i = lk[x]; i; i = hd[i])
      now = 0, dfs(s = to[i], x, ln[i]), sum += now, co[s] = now;
    if (ans > upd) fi = x, ans = upd;
    for (int s, i = lk[x]; i; i = hd[i])
      if (!vis[s = to[i]])
        if (2 * co[s] > sum) {
          x = s;
          fl = 1;
          break;
        }
  }
  printf("%d %lf", fi, ans);
}
