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>
#pragma GCC optimize("Ofast")
using namespace std;
void read(long long &x) {
  char ch = getchar();
  x = 0;
  while (!isdigit(ch)) ch = getchar();
  while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
}
const long long N = 2e5 + 10, M = N << 1;
long long n, rt, w[N], sz[N], mx[N], vis[N];
long long cnt, tot, h[N], nxt[M], to[M], len[M];
void add(long long u, long long v, long long l) {
  to[++cnt] = v, len[cnt] = l, nxt[cnt] = h[u], h[u] = cnt;
  to[++cnt] = u, len[cnt] = l, nxt[cnt] = h[v], h[v] = cnt;
}
void find(long long u, long long la) {
  sz[u] = 1;
  for (long long i = h[u], v; i; i = nxt[i]) {
    if ((v = to[i]) == la || vis[v]) continue;
    find(v, u), sz[u] += sz[v];
    mx[u] = max(mx[u], sz[v]);
  }
  mx[u] = max(mx[u], tot - sz[u]);
  if (mx[u] < mx[rt]) rt = u;
}
void get_sz(long long u, long long la) {
  mx[u] = 0, ++tot;
  for (long long i = h[u]; i; i = nxt[i])
    if (to[i] != la && !vis[to[i]]) get_sz(to[i], u);
}
void get_rt(long long u) {
  tot = 0;
  get_sz(u, 0);
  find(u, 0);
}
long long d[N];
double s[N];
void get(long long u, long long la) {
  s[u] = pow(d[u], 0.5) * w[u] * 1.5;
  for (long long i = h[u], v; i; i = nxt[i]) {
    if ((v = to[i]) == la) continue;
    d[v] = d[u] + len[i], get(v, u), s[u] += s[v];
  }
}
long long ans;
double res = 1e15, tmp;
void get_res(long long u, long long la, long long dep) {
  tmp += w[u] * pow(dep, 1.5);
  for (long long i = h[u]; i; i = nxt[i])
    if (to[i] != la) get_res(to[i], u, dep + len[i]);
}
void work(long long u) {
  vis[u] = 1;
  tmp = 0, get_res(u, 0, 0);
  if (tmp < res) ans = u, res = tmp;
  rt = 0, get_rt(u);
  d[rt] = 0, get(rt, 0);
  for (long long i = h[rt]; i; i = nxt[i])
    if (s[rt] < 2 * s[to[i]] && !vis[to[i]]) {
      work(to[i]);
      return;
    }
  if (!vis[rt]) work(rt);
}
signed main() {
  read(n);
  mx[0] = 1e9;
  for (long long i = 1; i <= n; ++i) read(w[i]);
  for (long long i = 1, u, v, l; i < n; ++i)
    read(u), read(v), read(l), add(u, v, l);
  work(1);
  printf("%lld %.10lf\n", ans, res);
  return 0;
}
