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;
int n, tot, root, num, pos;
double t;
double ans = 1e100;
const int N = 200010;
int w[N], head[N], to[N << 1], nt[N << 1], len[N << 1], mx[N], siz[N], vis[N],
    dis[N];
double sum[N];
void add(int f, int t, int d) {
  to[++tot] = t;
  len[tot] = d;
  nt[tot] = head[f];
  head[f] = tot;
}
void Groot(int x, int fa) {
  siz[x] = 1;
  mx[x] = 0;
  for (int i = head[x]; i; i = nt[i])
    if (!vis[to[i]] && to[i] != fa) {
      Groot(to[i], x);
      siz[x] += siz[to[i]];
      mx[x] = max(mx[x], siz[to[i]]);
    }
  mx[x] = max(mx[x], num - siz[x]);
  if (mx[x] < mx[root]) root = x;
}
void dfs(int x, int fa) {
  sum[x] = 0;
  for (int i = head[x]; i; i = nt[i])
    if (to[i] != fa)
      dis[to[i]] = dis[x] + len[i], dfs(to[i], x), sum[x] += sum[to[i]];
  sum[x] += w[x] * pow(dis[x], 0.5);
  t += w[x] * pow(dis[x], 1.5);
}
void solve(int x) {
  vis[x] = 1;
  t = 0;
  for (int i = head[x]; i; i = nt[i])
    dis[to[i]] = len[i], dfs(to[i], x), sum[x] += sum[to[i]];
  if (t < ans) ans = t, pos = x;
  double tmp, mn = 1e100;
  int To = 0;
  for (int i = head[x]; i; i = nt[i])
    if (!vis[to[i]]) {
      tmp = (sum[x] - sum[to[i]]) - sum[to[i]];
      if (tmp < mn) mn = tmp, To = to[i];
    }
  if (To) root = 0, num = siz[To], Groot(To, 0), solve(root);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) scanf("%d", &w[i]);
  for (int i = 1, x, y, z; i < n; ++i)
    scanf("%d%d%d", &x, &y, &z), add(x, y, z), add(y, x, z);
  mx[0] = 1 << 30;
  root = 0;
  num = n;
  Groot(1, 0);
  solve(root);
  printf("%d %.10f", pos, ans);
  return 0;
}
