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 double EPS = -1e8;
const double Pi = acos(-1);
bool inline equ(double a, double b) { return fabs(a - b) < EPS; }
const int MAXN = 200010;
int ansv;
double ansf;
int n;
int w[MAXN];
vector<pair<int, int> > g[MAXN];
int sz[MAXN], mxs[MAXN];
bool vis[MAXN];
double dissum[MAXN], gradsum[MAXN];
int dfssz(int u, int p) {
  sz[u] = 1;
  mxs[u] = 0;
  for (pair<int, int> e : g[u]) {
    int v = e.first;
    if (v == p || vis[v]) continue;
    sz[u] += dfssz(v, u);
    mxs[u] = max(mxs[u], sz[v]);
  }
  return sz[u];
}
void dfscp(int u, int p, int tot, int& cp) {
  mxs[u] = max(mxs[u], tot - sz[u]);
  if (mxs[u] < mxs[cp]) cp = u;
  for (pair<int, int> e : g[u]) {
    int v = e.first;
    if (v == p || vis[v]) continue;
    dfscp(v, u, tot, cp);
  }
}
void dfssum(int u, int p, double d) {
  dissum[u] = d * sqrt(d) * (double)w[u];
  gradsum[u] = sqrt(d) * (double)w[u];
  for (pair<int, int> e : g[u]) {
    int v = e.first;
    double c = e.second;
    if (v == p) continue;
    dfssum(v, u, d + c);
    dissum[u] += dissum[v];
    gradsum[u] += gradsum[v];
  }
}
inline int go(int u) {
  int res = 0;
  double sum = 0.0;
  double mxgrad = -1.0;
  for (pair<int, int> e : g[u]) {
    int v = e.first;
    double d = e.second;
    dfssum(v, u, d);
    if (mxgrad < gradsum[v]) {
      res = v;
      mxgrad = gradsum[v];
    }
    sum += dissum[v];
  }
  if (sum < ansf) tie(ansf, ansv) = make_tuple(sum, u);
  return res;
}
void calc(int rt) {
  dfssz(rt, -1);
  int u = rt;
  dfscp(rt, -1, sz[rt], u);
  int v = go(u);
  vis[u] = 1;
  if (v && !vis[v]) calc(v);
}
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (n); i++) scanf("%d", w + i);
  for (int i = (1); i <= (n - 1); i++) {
    int u, v, c;
    scanf("%d%d%d", &u, &v, &c);
    g[u].push_back(pair<int, int>(v, c));
    g[v].push_back(pair<int, int>(u, c));
  }
  ansf = 1e20;
  calc(1);
  printf("%d %.10f\n", ansv, ansf);
}
