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>
using namespace std;
const int N = 200005;
int go[N * 2], nx[N * 2], hd[N], w[N], son[N], len[N];
int n, tl, ai, rt, mi;
long double inv[N], ans;
bool vis[N];
void In(int& a) {
  a = 0;
  char c = getchar();
  for (; c < 48 || c > 57; c = getchar())
    ;
  for (; c > 47 && c < 58; c = getchar()) a = (a << 1) + (a << 3) + c - 48;
}
void get(int x, int fa, int all) {
  int mx = 1;
  son[x] = 1;
  for (int i = hd[x]; i; i = nx[i])
    if (!vis[go[i]] && go[i] != fa) {
      get(go[i], x, all);
      son[x] += son[go[i]];
      mx = ((mx) > (son[go[i]]) ? (mx) : (son[go[i]]));
    }
  mx = ((mx) > (all - son[x]) ? (mx) : (all - son[x]));
  if (mx < mi) mi = mx, rt = x;
}
void calc(int x, int fa, long double& tot, long double& inv, long double dis) {
  tot += dis * sqrt(dis) * w[x];
  inv += 1.50 * sqrt(dis) * w[x];
  for (int i = hd[x]; i; i = nx[i])
    if (go[i] != fa) calc(go[i], x, tot, inv, dis + len[i]);
}
void init(int x, int fa) {
  son[x] = 1;
  for (int i = hd[x]; i; i = nx[i])
    if (!vis[go[i]] && go[i] != fa) init(go[i], x), son[x] += son[go[i]];
}
void dfs(int x) {
  long double tot = 0, lei = 0;
  for (int i = hd[x]; i; i = nx[i])
    calc(go[i], x, tot, inv[go[i]], len[i]), lei += inv[go[i]];
  vis[x] = true;
  if (tot < ans) ans = tot, ai = x;
  for (int i = hd[x]; i; i = nx[i])
    if (!vis[go[i]] && lei - 2 * inv[go[i]] < 0) {
      init(go[i], x);
      rt = 0, mi = 1e9;
      init(go[i], x);
      get(go[i], x, son[go[i]]);
      dfs(rt);
      break;
    }
}
int main() {
  int u, v, w1;
  In(n);
  for (int i = (1), e_ = (n); i <= e_; i++) In(w[i]);
  for (int i = (1), e_ = (n - 1); i <= e_; i++) {
    In(u), In(v), In(w1);
    go[++tl] = v, nx[tl] = hd[u], hd[u] = tl, len[tl] = w1, go[++tl] = u,
    nx[tl] = hd[v], hd[v] = tl, len[tl] = w1;
  }
  rt = 0, mi = 1e9, ans = 1e18;
  get(1, 0, n);
  dfs(rt);
  printf("%d %.10LF", ai, ans);
  return 0;
}
