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 n, w[N], vis[N], sz[N];
vector<pair<int, int> > G[N];
pair<int, int> dfs(int u, int lst, int totsz) {
  sz[u] = 1;
  int mx = 0;
  pair<int, int> res = make_pair(0x3f3f3f3f, 0);
  for (auto P : G[u]) {
    int v = P.first;
    if (v == lst || vis[v]) continue;
    res = min(res, dfs(v, u, totsz));
    sz[u] += sz[v];
    mx = max(mx, sz[v]);
  }
  mx = max(mx, totsz - sz[u]);
  res = min(res, make_pair(mx, u));
  return res;
}
double sum, ss[N];
void dfs2(int u, int lst, int dist, int fr) {
  sum += pow(dist, 1.5) * w[u];
  ss[fr] += 1.5 * w[u] * sqrt(dist);
  for (auto P : G[u]) {
    int v = P.first;
    if (v == lst) continue;
    dfs2(v, u, dist + P.second, fr);
  }
}
pair<double, int> ans;
void solve(int rt, int totsz) {
  rt = dfs(rt, 0, totsz).second;
  dfs(rt, 0, totsz);
  vis[rt] = 1;
  sum = 0;
  double d = 0;
  for (auto P : G[rt]) {
    int v = P.first;
    ss[v] = 0;
    dfs2(v, rt, P.second, v);
    d += ss[v];
  }
  ans = min(ans, make_pair(sum, rt));
  for (auto P : G[rt]) {
    int v = P.first;
    if (vis[v]) continue;
    if (d - 2.0 * ss[v] < 0) {
      solve(v, sz[v]);
      break;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i < n; i++) {
    int u, v, l;
    scanf("%d%d%d", &u, &v, &l);
    G[u].push_back(make_pair(v, l));
    G[v].push_back(make_pair(u, l));
  }
  ans.first = 1e30;
  solve(1, n);
  printf("%d %.15lf\n", ans.second, ans.first);
  return 0;
}
